用树的重复数限定树的第一个萨格勒布索引

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-01-01 DOI:10.46793/match.89-3.723l

Hongying Lin, Jianguo Qian

{"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}

引用次数: 0

摘要

图G的第一个萨格勒布索引M1等于G的顶点度数平方和。图的重复数是其顶点度数列表中的最大多重数。在本文中，我们用仅依赖于树的重复次数的表达式从树的上下两个方向对树的第一个萨格勒布索引进行了绑定。

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

查看原文本刊更多论文

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 化学-化学综合

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.