First zagreb spectral radius of unicyclic graphs and trees

IF 0.9 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Combinatorial Optimization Pub Date : 2024-07-30 DOI:10.1007/s10878-024-01195-x
Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal
{"title":"First zagreb spectral radius of unicyclic graphs and trees","authors":"Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal","doi":"10.1007/s10878-024-01195-x","DOIUrl":null,"url":null,"abstract":"<p>In light of the successful investigation of the adjacency matrix, a significant amount of its modification is observed employing numerous topological indices. The matrix corresponding to the well-known first Zagreb index is one of them. The entries of the first Zagreb matrix are <span>\\(d_{u_i}+d_{u_j}\\)</span>, if <span>\\(u_i\\)</span> is connected to <span>\\(u_j\\)</span>; 0, otherwise, where <span>\\(d_{u_i}\\)</span> is degree of <i>i</i>-th vertex. The current work is concerned with the mathematical properties and chemical significance of the spectral radius (<span>\\(\\rho _1\\)</span>) associated with this matrix. The lower and upper bounds of <span>\\(\\rho _1\\)</span> are computed with characterizing extremal graphs for the class of unicyclic graphs and trees. The chemical connection of the first Zagreb spectral radius is established by exploring its role as a structural descriptor of molecules. The isomer discrimination ability of <span>\\(\\rho _1\\)</span> is also explained.\n</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01195-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In light of the successful investigation of the adjacency matrix, a significant amount of its modification is observed employing numerous topological indices. The matrix corresponding to the well-known first Zagreb index is one of them. The entries of the first Zagreb matrix are \(d_{u_i}+d_{u_j}\), if \(u_i\) is connected to \(u_j\); 0, otherwise, where \(d_{u_i}\) is degree of i-th vertex. The current work is concerned with the mathematical properties and chemical significance of the spectral radius (\(\rho _1\)) associated with this matrix. The lower and upper bounds of \(\rho _1\) are computed with characterizing extremal graphs for the class of unicyclic graphs and trees. The chemical connection of the first Zagreb spectral radius is established by exploring its role as a structural descriptor of molecules. The isomer discrimination ability of \(\rho _1\) is also explained.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
单环图和树的第一个萨格勒布谱半径
鉴于对邻接矩阵的成功研究,大量拓扑指数对其进行了修改。众所周知的第一萨格勒布指数对应的矩阵就是其中之一。如果 \(u_i)与 \(u_j)相连,则第一萨格勒布矩阵的条目为 \(d_{u_i}+d_{u_j}\);否则为 0,其中 \(d_{u_i}\)是第 i 个顶点的度数。目前的工作是研究与该矩阵相关的谱半径(\(\rho _1\))的数学性质和化学意义。在计算 \(\rho _1\)的下界和上界时,对单环图和树类的极值图进行了表征。通过探索第一萨格勒布光谱半径作为分子结构描述符的作用,建立了第一萨格勒布光谱半径的化学联系。还解释了 \(\rho _1\) 的异构体鉴别能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
期刊最新文献
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs Meta-heuristic-based hybrid deep learning model for vulnerability detection and prevention in software system The prize-collecting single machine scheduling with bounds and penalties
×
引用
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