树木的偏心谐波指数

IF 1 4区数学 Q1 MATHEMATICS

AKCE International Journal of Graphs and Combinatorics Pub Date : 2023-10-06 DOI:10.1080/09728600.2023.2263039

Yueping Su, Lieying Liao, Shaoqiang Liu

{"title":"树木的偏心谐波指数","authors":"Yueping Su, Lieying Liao, Shaoqiang Liu","doi":"10.1080/09728600.2023.2263039","DOIUrl":null,"url":null,"abstract":"Topological indices play an important role in mathematical chemistry, particularly in studies of quantitative structure property and quantitative structure activity relationships. The eccentric harmonic index of G is defined as He(G)=∑uv∈E(G)2e(u)+e(v), where uv is an edge of G, e(u) is the eccentricity of the vertex u in G. In this paper, we will determine the maximum and minmum eccentric harmonic index of trees in terms of graph parameters such as pendant number and matching number, and characterize corresponding extremal graphs.","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"19 1","pages":"0"},"PeriodicalIF":1.0000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The eccentric harmonic index of trees\",\"authors\":\"Yueping Su, Lieying Liao, Shaoqiang Liu\",\"doi\":\"10.1080/09728600.2023.2263039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Topological indices play an important role in mathematical chemistry, particularly in studies of quantitative structure property and quantitative structure activity relationships. The eccentric harmonic index of G is defined as He(G)=∑uv∈E(G)2e(u)+e(v), where uv is an edge of G, e(u) is the eccentricity of the vertex u in G. In this paper, we will determine the maximum and minmum eccentric harmonic index of trees in terms of graph parameters such as pendant number and matching number, and characterize corresponding extremal graphs.\",\"PeriodicalId\":48497,\"journal\":{\"name\":\"AKCE International Journal of Graphs and Combinatorics\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AKCE International Journal of Graphs and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/09728600.2023.2263039\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AKCE International Journal of Graphs and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09728600.2023.2263039","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

拓扑指标在数学化学中，特别是在定量结构性质和定量结构活性关系的研究中起着重要的作用。G的偏心调和指数定义为He(G)=∑uv∈E(G)2e(u)+ E(v)，其中uv为G的一条边，E(u)为G中顶点u的偏心率。本文将根据图的垂坠数和匹配数等图参数确定树的偏心调和指数的最大值和最小值，并对相应的极值图进行刻画。

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

查看原文本刊更多论文

The eccentric harmonic index of trees

Topological indices play an important role in mathematical chemistry, particularly in studies of quantitative structure property and quantitative structure activity relationships. The eccentric harmonic index of G is defined as He(G)=∑uv∈E(G)2e(u)+e(v), where uv is an edge of G, e(u) is the eccentricity of the vertex u in G. In this paper, we will determine the maximum and minmum eccentric harmonic index of trees in terms of graph parameters such as pendant number and matching number, and characterize corresponding extremal graphs.

求助全文

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

来源期刊

AKCE International Journal of Graphs and Combinatorics Multiple-

CiteScore

2.00

自引率

10.00%

发文量

审稿时长

28 weeks

期刊介绍： AKCE International Journal of Graphs and Combinatorics is devoted to publication of standard original research papers in Combinatorial Mathematics and related areas. The fields covered by the journal include: Graphs and hypergraphs, Network theory, Combinatorial optimization, Coding theory, Block designs, Combinatorial geometry, Matroid theory, Logic, Computing, Neural networks and any related topics. Each volume will consist of three issues to be published in the months of April, August and December every year. Contribution presented to the journal can be Full-length article, Review article, Short communication and about a conference. The journal will also publish proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standard of the journal.