关于图的Sombor能量猜想

Harishchandra S. Ramane, Deepa V. Kitturmath
{"title":"关于图的Sombor能量猜想","authors":"Harishchandra S. Ramane,&nbsp;Deepa V. Kitturmath","doi":"10.1016/j.exco.2023.100115","DOIUrl":null,"url":null,"abstract":"<div><p>The Sombor matrix of a graph <span><math><mi>G</mi></math></span> with vertices <span><math><mrow><msub><mrow><mi>v</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is defined as <span><math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>S</mi><mi>O</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><mrow><mo>[</mo><msub><mrow><mi>s</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>]</mo></mrow></mrow></math></span>, where <span><math><mrow><msub><mrow><mi>s</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo><msqrt><mrow><msubsup><mrow><mi>d</mi></mrow><mrow><mi>i</mi></mrow><mrow><mn>2</mn></mrow></msubsup><mo>+</mo><msubsup><mrow><mi>d</mi></mrow><mrow><mi>j</mi></mrow><mrow><mn>2</mn></mrow></msubsup></mrow></msqrt></mrow></math></span> if <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is adjacent to <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>j</mi></mrow></msub></math></span> and <span><math><mrow><msub><mrow><mi>s</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo><mn>0</mn></mrow></math></span>, otherwise, where <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is the degree of a vertex <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>. The Sombor energy of a graph is defined as the sum of the absolute values of the eigenvalues of the Sombor matrix. N. Ghanbari (Ghanbari, 2022) conjectured that there is no graph with integer valued Sombor energy. In this paper we give some class of graphs for which this conjecture holds. Further we conjecture that there is no regular graph with adjacency energy equal to <span><math><mrow><mn>2</mn><mi>k</mi><msqrt><mrow><mn>2</mn></mrow></msqrt></mrow></math></span> where <span><math><mi>k</mi></math></span> is a positive integer.</p></div>","PeriodicalId":100517,"journal":{"name":"Examples and Counterexamples","volume":"3 ","pages":"Article 100115"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the conjecture of Sombor energy of a graph\",\"authors\":\"Harishchandra S. Ramane,&nbsp;Deepa V. Kitturmath\",\"doi\":\"10.1016/j.exco.2023.100115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The Sombor matrix of a graph <span><math><mi>G</mi></math></span> with vertices <span><math><mrow><msub><mrow><mi>v</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>v</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is defined as <span><math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>S</mi><mi>O</mi></mrow></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>=</mo><mrow><mo>[</mo><msub><mrow><mi>s</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>]</mo></mrow></mrow></math></span>, where <span><math><mrow><msub><mrow><mi>s</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo><msqrt><mrow><msubsup><mrow><mi>d</mi></mrow><mrow><mi>i</mi></mrow><mrow><mn>2</mn></mrow></msubsup><mo>+</mo><msubsup><mrow><mi>d</mi></mrow><mrow><mi>j</mi></mrow><mrow><mn>2</mn></mrow></msubsup></mrow></msqrt></mrow></math></span> if <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is adjacent to <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>j</mi></mrow></msub></math></span> and <span><math><mrow><msub><mrow><mi>s</mi></mrow><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo><mn>0</mn></mrow></math></span>, otherwise, where <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span> is the degree of a vertex <span><math><msub><mrow><mi>v</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>. The Sombor energy of a graph is defined as the sum of the absolute values of the eigenvalues of the Sombor matrix. N. Ghanbari (Ghanbari, 2022) conjectured that there is no graph with integer valued Sombor energy. In this paper we give some class of graphs for which this conjecture holds. Further we conjecture that there is no regular graph with adjacency energy equal to <span><math><mrow><mn>2</mn><mi>k</mi><msqrt><mrow><mn>2</mn></mrow></msqrt></mrow></math></span> where <span><math><mi>k</mi></math></span> is a positive integer.</p></div>\",\"PeriodicalId\":100517,\"journal\":{\"name\":\"Examples and Counterexamples\",\"volume\":\"3 \",\"pages\":\"Article 100115\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Examples and Counterexamples\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2666657X23000174\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Examples and Counterexamples","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2666657X23000174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

具有顶点v1,v2,…,vn的图G的Sombor矩阵被定义为ASO(G)=[sij],其中如果vi与vj相邻并且sij=0,则sij=di2+dj2,否则,其中di是顶点vi的阶。图的Sombor能量被定义为Sombor阵本征值的绝对值之和。N.Ghanbari(Gannbari,2022)推测不存在具有整数值Sombor能量的图。本文给出了这一猜想成立的一类图。此外,我们推测不存在邻接能量等于2k2的正则图,其中k是正整数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the conjecture of Sombor energy of a graph

The Sombor matrix of a graph G with vertices v1,v2,,vn is defined as ASO(G)=[sij], where sij=di2+dj2 if vi is adjacent to vj and sij=0, otherwise, where di is the degree of a vertex vi. The Sombor energy of a graph is defined as the sum of the absolute values of the eigenvalues of the Sombor matrix. N. Ghanbari (Ghanbari, 2022) conjectured that there is no graph with integer valued Sombor energy. In this paper we give some class of graphs for which this conjecture holds. Further we conjecture that there is no regular graph with adjacency energy equal to 2k2 where k is a positive integer.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
0
期刊最新文献
Automation of image processing through ML algorithms of GRASS GIS using embedded Scikit-Learn library of Python Counterexamples for your calculus course Hölder’s inequality for shifted quantum integral operator Solving change of basis from Bernstein to Chebyshev polynomials Asymptotic behavior of the empirical checkerboard copula process for binary data: An educational presentation
×
引用
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