Maximal first Zagreb connection index of trees with given total domination number

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2025-02-27 DOI:10.1016/j.dam.2025.02.031
Zahid Raza , Shehnaz Akhter , Roslan Hasni
{"title":"Maximal first Zagreb connection index of trees with given total domination number","authors":"Zahid Raza ,&nbsp;Shehnaz Akhter ,&nbsp;Roslan Hasni","doi":"10.1016/j.dam.2025.02.031","DOIUrl":null,"url":null,"abstract":"<div><div>Chemical graph theory plays a crucial role in mathematical chemistry by using graph invariants to represent chemical phenomena in a mathematical framework. Topological descriptors, which are graph invariants formed from molecular graph representations of chemical compounds, are employed in QSPR and QSAR studies. The Zagreb connection indices are topological descriptors which are used to analyze graphs based on connection cardinality. They were introduced in 1972 to calculate the total electron energy of alternate hydrocarbons. Recently, they have gained renewed attention due to their ability to provide a more precise correlation for the physicochemical characteristics of different compounds compared to basic Zagreb indices. In this article, we aim to analyze and establish the correlations of the first Zagreb connection index and the total domination number of trees. Our focus is on providing a detailed description of trees having the largest first Zagreb connection index among trees that have a specific total domination number.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"368 ","pages":"Pages 82-90"},"PeriodicalIF":1.0000,"publicationDate":"2025-02-27","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/S0166218X25001052","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Chemical graph theory plays a crucial role in mathematical chemistry by using graph invariants to represent chemical phenomena in a mathematical framework. Topological descriptors, which are graph invariants formed from molecular graph representations of chemical compounds, are employed in QSPR and QSAR studies. The Zagreb connection indices are topological descriptors which are used to analyze graphs based on connection cardinality. They were introduced in 1972 to calculate the total electron energy of alternate hydrocarbons. Recently, they have gained renewed attention due to their ability to provide a more precise correlation for the physicochemical characteristics of different compounds compared to basic Zagreb indices. In this article, we aim to analyze and establish the correlations of the first Zagreb connection index and the total domination number of trees. Our focus is on providing a detailed description of trees having the largest first Zagreb connection index among trees that have a specific total domination number.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
给定总控制数的树的最大第一萨格勒布连接索引
化学图论利用图不变量在数学框架中表示化学现象,在数学化学中起着至关重要的作用。拓扑描述符是由化合物的分子图表示形成的图不变量,用于QSPR和QSAR研究。萨格勒布连接索引是基于连接基数分析图的拓扑描述符。它们是在1972年引入的,用于计算替代碳氢化合物的总电子能量。最近,由于与基本的萨格勒布指数相比,它们能够为不同化合物的物理化学特性提供更精确的相关性,它们重新引起了人们的注意。在本文中,我们的目的是分析和建立第一萨格勒布连接指数和树的总支配数的相关性。我们的重点是在具有特定总支配数的树木中提供具有最大第一萨格勒布连接指数的树木的详细描述。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
The Maximum Independent Set problem on circulant graphs Cn(a,b) Block graphs — Some general results and their equitable colorings The generalized 3-connectivity of BCCC data center networks Editorial Board More on discrete convexity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1