The Complete Classification of Graphs whose Second Largest Eigenvalue of the Eccentricity Matrix is Less Than 1

IF 0.8 3区 数学 Q2 MATHEMATICS Acta Mathematica Sinica-English Series Pub Date : 2024-04-15 DOI:10.1007/s10114-024-2413-x
Jian Feng Wang, Xing Yu Lei, Shu Chao Li, Zoran Stanić
{"title":"The Complete Classification of Graphs whose Second Largest Eigenvalue of the Eccentricity Matrix is Less Than 1","authors":"Jian Feng Wang, Xing Yu Lei, Shu Chao Li, Zoran Stanić","doi":"10.1007/s10114-024-2413-x","DOIUrl":null,"url":null,"abstract":"<p>The eccentricity matrix of a graph is obtained from the distance matrix by keeping the entries that are largest in their row or column, and replacing the remaining entries by zero. This matrix can be interpreted as an opposite to the adjacency matrix, which is on the contrary obtained from the distance matrix by keeping only the entries equal to 1. In the paper, we determine graphs having the second largest eigenvalue of eccentricity matrix less than 1.</p>","PeriodicalId":50893,"journal":{"name":"Acta Mathematica Sinica-English Series","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematica Sinica-English Series","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10114-024-2413-x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

The eccentricity matrix of a graph is obtained from the distance matrix by keeping the entries that are largest in their row or column, and replacing the remaining entries by zero. This matrix can be interpreted as an opposite to the adjacency matrix, which is on the contrary obtained from the distance matrix by keeping only the entries equal to 1. In the paper, we determine graphs having the second largest eigenvalue of eccentricity matrix less than 1.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
偏心矩阵第二最大特征值小于 1 的图的完整分类
图形的偏心矩阵是从距离矩阵中得到的,方法是保留其行或列中最大的条目,并将其余条目替换为零。这个矩阵可以解释为与邻接矩阵相反的矩阵,邻接矩阵是从距离矩阵中只保留等于 1 的条目得到的。在本文中,我们将确定偏心矩阵第二大特征值小于 1 的图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.00
自引率
0.00%
发文量
138
审稿时长
14.5 months
期刊介绍: Acta Mathematica Sinica, established by the Chinese Mathematical Society in 1936, is the first and the best mathematical journal in China. In 1985, Acta Mathematica Sinica is divided into English Series and Chinese Series. The English Series is a monthly journal, publishing significant research papers from all branches of pure and applied mathematics. It provides authoritative reviews of current developments in mathematical research. Contributions are invited from researchers from all over the world.
期刊最新文献
Quantum Fibrations: Quantum Computation on an Arbitrary Topological Space Reducibility of Three Dimensional Skew Symmetric System with High Dimensional Weak Liouvillean Frequencies On Variational Principles of Metric Mean Dimension on Subsets in Feldman–Katok Metric Uncertainty Principles on Clifford Modules A Note on the Entropy for Heisenberg Group Actions on the Torus
×
引用
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