树木的偏心谐波指数

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的偏心率。本文将根据图的垂坠数和匹配数等图参数确定树的偏心调和指数的最大值和最小值,并对相应的极值图进行刻画。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.00
自引率
10.00%
发文量
40
审稿时长
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.
期刊最新文献
Power domination in Mycielskians of n -spiders Mixed metric dimension over (edge) corona products First-order logic with metric betweenness – the case of non-definability of some graph classes What can graphs and algebraic structures say to each other? Metric Dimension of Irregular Convex Triangular Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1