On Graphs Whose Second Largest Eigenvalue Is Less Than 1
Xu Guanghui(1)(2),Shao Jiayu(2)
Author information+
(1)Department of Applied Mathematics, Zhejiang Forestry College, Hangzhou311300
(2)Department of Applied Mathematics, Tongji University, Shanghai 200092
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
Collapse
文章历史+
收稿日期
修回日期
出版日期
2002-12-30
2004-11-15
2006-02-25
发布日期
2006-02-25
摘要
设为阶简单图,为的第二大特征根. 给出了所有使的偶图,以及使 、围长不小于4的非偶图.
Abstract
Let be a simple graph with vertices, and let be the eigenvalues of the adjacency matrix of . We call the second largest eigenvalue of . In this paper, all the non-bipartite graphs with girth and all the bipartite graphs whose second largest eigenvalue is less than 1 have been determined.
Xu Guanghui
, Shao Jiayu. , {{custom_author.name_en}}.
On Graphs Whose Second Largest Eigenvalue Is Less Than 1. Journal of Systems Science and Mathematical Sciences, 2006, 26(1): 121-128 https://doi.org/10.12341/jssms09235