给定度序列树的极值Sombor指数的一个注记

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2022-11-22 DOI:10.46793/match.90-1.197d

Ivan Damnjanovi'c, Marko Milovsevi'c, Dragan Stevanovi'c

{"title":"给定度序列树的极值Sombor指数的一个注记","authors":"Ivan Damnjanovi'c, Marko Milovsevi'c, Dragan Stevanovi'c","doi":"10.46793/match.90-1.197d","DOIUrl":null,"url":null,"abstract":"We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy tree has the minimum Sombor index, while an alternating greedy tree has the maximum Sombor index.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"13 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence\",\"authors\":\"Ivan Damnjanovi'c, Marko Milovsevi'c, Dragan Stevanovi'c\",\"doi\":\"10.46793/match.90-1.197d\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy tree has the minimum Sombor index, while an alternating greedy tree has the maximum Sombor index.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":\"13 1\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2022-11-22\",\"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.197d\",\"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.197d","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

我们注意到，对于给定度序列的树，确定Sombor指数极值的问题符合[Cent. Eur]王华的结果框架。J. Math. 12(2014) 1656-1663]，这意味着贪心树具有最小的Sombor索引，而交替贪心树具有最大的Sombor索引。

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

查看原文本刊更多论文

A Note on Extremal Sombor Indices of Trees with a Given Degree Sequence

We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur. J. Math. 12 (2014) 1656-1663], implying that the greedy tree has the minimum Sombor index, while an alternating greedy tree has the maximum Sombor index.

求助全文

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

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： 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.