{"title":"用树的重复数限定树的第一个萨格勒布索引","authors":"Hongying Lin, Jianguo Qian","doi":"10.46793/match.89-3.723l","DOIUrl":null,"url":null,"abstract":"The first Zagreb index M1 of a graph G is equal to the sum of squares of the vertex degrees of G. The repetition number of a graph is the maximum multiplicity in the list of its vertex degrees. In this note, we bound the first Zagreb index of a tree from both below and above by expressions depending solely on its repetition number.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"31 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounding the First Zagreb Index of a Tree in Term of Its Repetition Number\",\"authors\":\"Hongying Lin, Jianguo Qian\",\"doi\":\"10.46793/match.89-3.723l\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The first Zagreb index M1 of a graph G is equal to the sum of squares of the vertex degrees of G. The repetition number of a graph is the maximum multiplicity in the list of its vertex degrees. In this note, we bound the first Zagreb index of a tree from both below and above by expressions depending solely on its repetition number.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":\"31 1\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2023-01-01\",\"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.89-3.723l\",\"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.89-3.723l","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
Bounding the First Zagreb Index of a Tree in Term of Its Repetition Number
The first Zagreb index M1 of a graph G is equal to the sum of squares of the vertex degrees of G. The repetition number of a graph is the maximum multiplicity in the list of its vertex degrees. In this note, we bound the first Zagreb index of a tree from both below and above by expressions depending solely on its repetition number.
期刊介绍：
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
分享
求助内容：
应助结果提醒方式：
扫码关注我们
