关于单环图的最大指数增强萨格勒布指数的未决问题

IF 2.6 3区 数学
Kinkar Chandra Das, Sourav Mondal, Da-yeon Huh
{"title":"关于单环图的最大指数增强萨格勒布指数的未决问题","authors":"Kinkar Chandra Das, Sourav Mondal, Da-yeon Huh","doi":"10.1007/s40314-024-02815-2","DOIUrl":null,"url":null,"abstract":"<p>A topological index is a numerical property of a molecular graph that explains structural features of molecules. The potential of topological indices to discriminate between distinct structures is a significant topic to investigate. In this context, the exponential degree-based indices were put forward in the literature. The present work focuses on the exponential augmented Zagreb index (<i>EAZ</i>), which is defined for a graph <i>G</i> as </p><span>$$\\begin{aligned} EAZ(G)=\\sum \\limits _{v_{i}v_{j} \\in E(G)}\\,e^{\\displaystyle {\\left( \\frac{{d_i\\,d_j}}{d_i+d_j-2}\\right) ^{3}}}, \\end{aligned}$$</span><p>where <span>\\(d_i\\)</span> represents the degree of the vertex <span>\\(v_i\\)</span>and <i>E</i>(<i>G</i>) denotes the edge set of <i>G</i>. This work characterizes the maximal unicyclic graph for <i>EAZ</i> in terms of graph order, which was posed as an open problem in the recent article Cruz et al. (MATCH Commun Math Comput Chem 88:481-503, 2022).\n</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"17 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs\",\"authors\":\"Kinkar Chandra Das, Sourav Mondal, Da-yeon Huh\",\"doi\":\"10.1007/s40314-024-02815-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A topological index is a numerical property of a molecular graph that explains structural features of molecules. The potential of topological indices to discriminate between distinct structures is a significant topic to investigate. In this context, the exponential degree-based indices were put forward in the literature. The present work focuses on the exponential augmented Zagreb index (<i>EAZ</i>), which is defined for a graph <i>G</i> as </p><span>$$\\\\begin{aligned} EAZ(G)=\\\\sum \\\\limits _{v_{i}v_{j} \\\\in E(G)}\\\\,e^{\\\\displaystyle {\\\\left( \\\\frac{{d_i\\\\,d_j}}{d_i+d_j-2}\\\\right) ^{3}}}, \\\\end{aligned}$$</span><p>where <span>\\\\(d_i\\\\)</span> represents the degree of the vertex <span>\\\\(v_i\\\\)</span>and <i>E</i>(<i>G</i>) denotes the edge set of <i>G</i>. This work characterizes the maximal unicyclic graph for <i>EAZ</i> in terms of graph order, which was posed as an open problem in the recent article Cruz et al. (MATCH Commun Math Comput Chem 88:481-503, 2022).\\n</p>\",\"PeriodicalId\":51278,\"journal\":{\"name\":\"Computational and Applied Mathematics\",\"volume\":\"17 1\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s40314-024-02815-2\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s40314-024-02815-2","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

拓扑指数是分子图谱的一种数字特性,可以解释分子的结构特征。拓扑指数区分不同结构的潜力是一个重要的研究课题。在这方面,文献中提出了基于指数度的指数。本研究的重点是指数增强萨格勒布指数(EAZ),该指数对图 G 的定义为:$$\begin{aligned}(开始{aligned})。EAZ(G)=sum \limits _{v_{i}v_{j}\in E(G)}\,e^{displaystyle {\left( \frac{d_i\,d_j}}{d_i+d_j-2}\right) ^{3}}, \end{aligned}$$其中 \(d_i/)表示顶点 \(v_i/)的度,E(G) 表示 G 的边集。这项工作从图序的角度描述了 EAZ 的最大单环图的特征,而这是克鲁兹等人最近发表的文章(MATCH Commun Math Comput Chem 88:481-503, 2022)中提出的一个开放性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs

Open problem on the maximum exponential augmented Zagreb index of unicyclic graphs

A topological index is a numerical property of a molecular graph that explains structural features of molecules. The potential of topological indices to discriminate between distinct structures is a significant topic to investigate. In this context, the exponential degree-based indices were put forward in the literature. The present work focuses on the exponential augmented Zagreb index (EAZ), which is defined for a graph G as

$$\begin{aligned} EAZ(G)=\sum \limits _{v_{i}v_{j} \in E(G)}\,e^{\displaystyle {\left( \frac{{d_i\,d_j}}{d_i+d_j-2}\right) ^{3}}}, \end{aligned}$$

where \(d_i\) represents the degree of the vertex \(v_i\)and E(G) denotes the edge set of G. This work characterizes the maximal unicyclic graph for EAZ in terms of graph order, which was posed as an open problem in the recent article Cruz et al. (MATCH Commun Math Comput Chem 88:481-503, 2022).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
11.50%
发文量
352
期刊介绍: Computational & Applied Mathematics began to be published in 1981. This journal was conceived as the main scientific publication of SBMAC (Brazilian Society of Computational and Applied Mathematics). The objective of the journal is the publication of original research in Applied and Computational Mathematics, with interfaces in Physics, Engineering, Chemistry, Biology, Operations Research, Statistics, Social Sciences and Economy. The journal has the usual quality standards of scientific international journals and we aim high level of contributions in terms of originality, depth and relevance.
×
引用
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学术官方微信