(n,m)-图的指数增广萨格勒布指数

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED
Chunlei Xu , Lkhagva Buyantogtokh , Shiikhar Dorjsembe , Dechinpuntsag Bolormaa , Suyalabateer Bao
{"title":"(n,m)-图的指数增广萨格勒布指数","authors":"Chunlei Xu ,&nbsp;Lkhagva Buyantogtokh ,&nbsp;Shiikhar Dorjsembe ,&nbsp;Dechinpuntsag Bolormaa ,&nbsp;Suyalabateer Bao","doi":"10.1016/j.dam.2025.06.009","DOIUrl":null,"url":null,"abstract":"<div><div>In the fields of graph theory and chemical graph theory, topological indices play a crucial role in characterizing the structural properties of molecules. This paper focuses on the extremum problems related to the exponential augmented Zagreb index (EAZ) within the class of <span><math><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>m</mi><mo>)</mo></mrow></math></span>-graphs. The EAZ index for a graph <span><math><mi>G</mi></math></span> is defined as <span><span><span><math><mrow><mi>E</mi><mi>A</mi><mi>Z</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><munder><mrow><mo>∑</mo></mrow><mrow><mi>u</mi><mi>v</mi><mo>∈</mo><mi>E</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></munder><msup><mrow><mi>e</mi></mrow><mrow><msup><mrow><mfenced><mrow><mfrac><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>u</mi></mrow></msub><mo>+</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>v</mi></mrow></msub><mo>−</mo><mn>2</mn></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>u</mi></mrow></msub><msub><mrow><mi>d</mi></mrow><mrow><mi>v</mi></mrow></msub></mrow></mfrac></mrow></mfenced></mrow><mrow><mn>3</mn></mrow></msup></mrow></msup><mo>,</mo></mrow></math></span></span></span>where <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>u</mi></mrow></msub></math></span> represents the degree of a vertex <span><math><mi>u</mi></math></span>. By employing inequality techniques and graph operation constructions, the extremum problems of this index are thoroughly analyzed. The maximum values of this index are precisely determined, and the corresponding structural characteristics of the graphs that achieve these extreme values are described in detail.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"376 ","pages":"Pages 151-159"},"PeriodicalIF":1.0000,"publicationDate":"2025-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exponential augmented Zagreb index of (n,m)-graphs\",\"authors\":\"Chunlei Xu ,&nbsp;Lkhagva Buyantogtokh ,&nbsp;Shiikhar Dorjsembe ,&nbsp;Dechinpuntsag Bolormaa ,&nbsp;Suyalabateer Bao\",\"doi\":\"10.1016/j.dam.2025.06.009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In the fields of graph theory and chemical graph theory, topological indices play a crucial role in characterizing the structural properties of molecules. This paper focuses on the extremum problems related to the exponential augmented Zagreb index (EAZ) within the class of <span><math><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>m</mi><mo>)</mo></mrow></math></span>-graphs. The EAZ index for a graph <span><math><mi>G</mi></math></span> is defined as <span><span><span><math><mrow><mi>E</mi><mi>A</mi><mi>Z</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><munder><mrow><mo>∑</mo></mrow><mrow><mi>u</mi><mi>v</mi><mo>∈</mo><mi>E</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></munder><msup><mrow><mi>e</mi></mrow><mrow><msup><mrow><mfenced><mrow><mfrac><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>u</mi></mrow></msub><mo>+</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>v</mi></mrow></msub><mo>−</mo><mn>2</mn></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>u</mi></mrow></msub><msub><mrow><mi>d</mi></mrow><mrow><mi>v</mi></mrow></msub></mrow></mfrac></mrow></mfenced></mrow><mrow><mn>3</mn></mrow></msup></mrow></msup><mo>,</mo></mrow></math></span></span></span>where <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>u</mi></mrow></msub></math></span> represents the degree of a vertex <span><math><mi>u</mi></math></span>. By employing inequality techniques and graph operation constructions, the extremum problems of this index are thoroughly analyzed. The maximum values of this index are precisely determined, and the corresponding structural characteristics of the graphs that achieve these extreme values are described in detail.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"376 \",\"pages\":\"Pages 151-159\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X25003245\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25003245","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

在图论和化学图论中,拓扑指标在表征分子的结构性质方面起着至关重要的作用。研究了一类(n,m)-图中与指数增广萨格勒布指数(EAZ)有关的极值问题。将图G的EAZ指标定义为EAZ(G)=∑uv∈E(G)edu+dv−2dudv3,其中du表示顶点u的度。利用不等式技术和图运算构造,深入分析了该指标的极值问题。精确地确定了该指标的最大值,并详细描述了达到这些极值的图形的相应结构特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Exponential augmented Zagreb index of (n,m)-graphs
In the fields of graph theory and chemical graph theory, topological indices play a crucial role in characterizing the structural properties of molecules. This paper focuses on the extremum problems related to the exponential augmented Zagreb index (EAZ) within the class of (n,m)-graphs. The EAZ index for a graph G is defined as EAZ(G)=uvE(G)edu+dv2dudv3,where du represents the degree of a vertex u. By employing inequality techniques and graph operation constructions, the extremum problems of this index are thoroughly analyzed. The maximum values of this index are precisely determined, and the corresponding structural characteristics of the graphs that achieve these extreme values are described in detail.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信