{"title":"Chebyshev和不等式与Zagreb指数不等式","authors":"Hanjo Taubig","doi":"10.46793/match.90-1.187t","DOIUrl":null,"url":null,"abstract":"In a recent article, Nadeem and Siddique used Chebyshev’s sum inequality to establish the Zagreb indices inequality M1/n ≤ M2/m for undirected graphs in the case where the degree sequence (di) and the degree-sum sequence (Si) are similarly ordered. We show that this is actually not a completely new result and we discuss several related results that also cover similar inequalities for directed graphs, as well as sum-symmetric matrices and Eulerian directed graphs.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"6 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Chebyshev's Sum Inequality and the Zagreb Indices Inequality\",\"authors\":\"Hanjo Taubig\",\"doi\":\"10.46793/match.90-1.187t\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a recent article, Nadeem and Siddique used Chebyshev’s sum inequality to establish the Zagreb indices inequality M1/n ≤ M2/m for undirected graphs in the case where the degree sequence (di) and the degree-sum sequence (Si) are similarly ordered. We show that this is actually not a completely new result and we discuss several related results that also cover similar inequalities for directed graphs, as well as sum-symmetric matrices and Eulerian directed graphs.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":\"6 1\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2022-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.46793/match.90-1.187t\",\"RegionNum\":2,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.90-1.187t","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
Chebyshev's Sum Inequality and the Zagreb Indices Inequality
In a recent article, Nadeem and Siddique used Chebyshev’s sum inequality to establish the Zagreb indices inequality M1/n ≤ M2/m for undirected graphs in the case where the degree sequence (di) and the degree-sum sequence (Si) are similarly ordered. We show that this is actually not a completely new result and we discuss several related results that also cover similar inequalities for directed graphs, as well as sum-symmetric matrices and Eulerian directed graphs.
期刊介绍：
MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
