基于顶点度拓扑指标的极值单环图

IF 2.9 2区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY
Roberto Cruz, J. Rada, Wilson Sanchez
{"title":"基于顶点度拓扑指标的极值单环图","authors":"Roberto Cruz, J. Rada, Wilson Sanchez","doi":"10.46793/match.88-3.481c","DOIUrl":null,"url":null,"abstract":"n this paper we present a general criteria to decide when the cycle on vertices and , the coalescence of the star with the cycle , are extremal unicyclic graphs of a vertex-degree-based (VDB) topological index. We show that many of the well known results on extremal values of VDB topological indices over unicyclic graphs can be obtained as particular cases of ours. Moreover, we obtain new results on extremal values of VDB topological indices, such as the generalized Geometric-Arithmetic indices, the generalized Atom-Bond-Connectivity indices, and its exponentials, among others.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":null,"pages":null},"PeriodicalIF":2.9000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Extremal Unicyclic Graphs with Respect to Vertex-Degree-Based Topological Indices\",\"authors\":\"Roberto Cruz, J. Rada, Wilson Sanchez\",\"doi\":\"10.46793/match.88-3.481c\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"n this paper we present a general criteria to decide when the cycle on vertices and , the coalescence of the star with the cycle , are extremal unicyclic graphs of a vertex-degree-based (VDB) topological index. We show that many of the well known results on extremal values of VDB topological indices over unicyclic graphs can be obtained as particular cases of ours. Moreover, we obtain new results on extremal values of VDB topological indices, such as the generalized Geometric-Arithmetic indices, the generalized Atom-Bond-Connectivity indices, and its exponentials, among others.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2022-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.46793/match.88-3.481c\",\"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.88-3.481c","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 4

摘要

本文给出了判定顶点上的环和星与环的聚并是否是顶点度拓扑索引的极值单环图的一般判据。我们证明了许多关于单环图上VDB拓扑指标极值的著名结果可以作为我们的特殊情况得到。此外,我们还得到了VDB拓扑指标极值的新结果,如广义几何算术指标、广义原子键连通性指标及其指数等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Extremal Unicyclic Graphs with Respect to Vertex-Degree-Based Topological Indices
n this paper we present a general criteria to decide when the cycle on vertices and , the coalescence of the star with the cycle , are extremal unicyclic graphs of a vertex-degree-based (VDB) topological index. We show that many of the well known results on extremal values of VDB topological indices over unicyclic graphs can be obtained as particular cases of ours. Moreover, we obtain new results on extremal values of VDB topological indices, such as the generalized Geometric-Arithmetic indices, the generalized Atom-Bond-Connectivity indices, and its exponentials, among others.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.40
自引率
26.90%
发文量
71
审稿时长
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信