图的一般偏心距离和的界

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2022-08-30 DOI:10.47443/dml.2022.070

Yetneberk Kuma Feyissa, T. Vetrík

{"title":"图的一般偏心距离和的界","authors":"Yetneberk Kuma Feyissa, T. Vetrík","doi":"10.47443/dml.2022.070","DOIUrl":null,"url":null,"abstract":"Some sharp bounds on the general eccentric distance sum are presented for (i) graphs with given order and chromatic number, (ii) trees with given bipartition, and (iii) bipartite graphs with given order and matching number. Bounds for bipartite graphs hold also if the matching number is replaced by the independence number, vertex cover number or edge cover number.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounds on the general eccentric distance sum of graphs\",\"authors\":\"Yetneberk Kuma Feyissa, T. Vetrík\",\"doi\":\"10.47443/dml.2022.070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Some sharp bounds on the general eccentric distance sum are presented for (i) graphs with given order and chromatic number, (ii) trees with given bipartition, and (iii) bipartite graphs with given order and matching number. Bounds for bipartite graphs hold also if the matching number is replaced by the independence number, vertex cover number or edge cover number.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2022.070\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2022.070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

对于(i)给定阶数和色数的图，(ii)给定二分的树，以及(iii)给定阶数和匹配数的二部图，给出了一般偏心距离和的锐利界。当匹配数被独立数、顶点覆盖数或边覆盖数取代时，二部图的边界也成立。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Bounds on the general eccentric distance sum of graphs

Some sharp bounds on the general eccentric distance sum are presented for (i) graphs with given order and chromatic number, (ii) trees with given bipartition, and (iii) bipartite graphs with given order and matching number. Bounds for bipartite graphs hold also if the matching number is replaced by the independence number, vertex cover number or edge cover number.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks