Spectral characterization of graphs whose second largest eigenvalue is less than 1 |
| |
Authors: | Fenjin Liu Jianfeng Wang |
| |
Affiliation: | a College of Mathematics and System Science, Xinjiang University, Urumqi 830046, China b Department of Mathematics, Qinghai Normal University, Xining, Qinghai 810008, China |
| |
Abstract: | Graphs with second largest eigenvalue λ2?1 are extensively studied, however, whether they are determined by their adjacency spectra or not is less considered. In this paper we completely characterize all the connected bipartite graphs with λ2<1 that are determined by their adjacency spectra. In addition, we prove that all the connected non-bipartite graphs with girth no less than 4 and λ2<1 are determined by their adjacency spectra. |
| |
Keywords: | Spectrum Cospectral graphs Second largest eigenvalue Spectral characterization |
本文献已被 ScienceDirect 等数据库收录! |
|