Extreme Sombor Spectral Radius of Unicyclic Graphs

IF 2.9 2区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY
Yinzhen Mei, Huifeng Fu, Hongli Miao, Yubin Gao
{"title":"Extreme Sombor Spectral Radius of Unicyclic Graphs","authors":"Yinzhen Mei, Huifeng Fu, Hongli Miao, Yubin Gao","doi":"10.46793/match.90-2.513m","DOIUrl":null,"url":null,"abstract":"Let G be a graph, the Sombor matrix S ( G ) of G was recently introduced by Wang et al. It is a new matrix based on Sombor index, where the ( i, j ) entry S ij = (cid:113) d 2 i + d 2 j if vertices i and vertices j are adjacent in G , and S ij = 0 for other cases. Xueliang Li and Junming Wang solved the conjecture for the upper and lower bounds of the ABC spectral radius for unicyclic graphs by Ghorbani et all. Inspired by this, we investigate the spectral radius on Sombor matrix of unicyclic graphs. In the paper, we use the method of classified discussion and Cauchy-Schwartz inequality to determine the external Sombor spectral radius of unicyclic graphs and provide the conditions for the equality.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"26 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.90-2.513m","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Let G be a graph, the Sombor matrix S ( G ) of G was recently introduced by Wang et al. It is a new matrix based on Sombor index, where the ( i, j ) entry S ij = (cid:113) d 2 i + d 2 j if vertices i and vertices j are adjacent in G , and S ij = 0 for other cases. Xueliang Li and Junming Wang solved the conjecture for the upper and lower bounds of the ABC spectral radius for unicyclic graphs by Ghorbani et all. Inspired by this, we investigate the spectral radius on Sombor matrix of unicyclic graphs. In the paper, we use the method of classified discussion and Cauchy-Schwartz inequality to determine the external Sombor spectral radius of unicyclic graphs and provide the conditions for the equality.
单环图的极限Sombor谱半径
设G为图,G的Sombor矩阵S (G)最近由Wang等人引入。它是一个基于Sombor索引的新矩阵,其中(i, j)项S ij = (cid:113) d2 i + d2 j,如果顶点i和顶点j在G中相邻,则S ij = 0。李学良、王俊明等解决了Ghorbani等关于单环图ABC谱半径上界和下界的猜想。受此启发,我们研究了单环图Sombor矩阵上的谱半径。本文利用分类讨论的方法和Cauchy-Schwartz不等式确定了单环图的外Sombor谱半径,并给出了该不等式成立的条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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学术官方微信