Characterization of Graphs with Some Normalized Laplacian Eigenvalue Having Multiplicity $n{-}4$

Shaowei Sun

Communications in Mathematics and Statistics ›› : 1 -11.

PDF
Communications in Mathematics and Statistics ›› : 1 -11. DOI: 10.1007/s40304-024-00395-5
Article

Characterization of Graphs with Some Normalized Laplacian Eigenvalue Having Multiplicity $n{-}4$

Author information +
History +
PDF

Abstract

The spectrum of the normalized Laplacian matrix of a graph provides a lot of structural information of the graph, and it has applications in numerous areas and in different guises. In this paper, we completely characterize all connected graphs of order $n\ge 25$ with some normalized Laplacian eigenvalue $\rho \in \big (0,\,\frac{n-1}{n-2}\big )$ having multiplicity $n{-4}$.

Keywords

Graph / Normalized Laplacian matrix / Multiplicity of eigenvalues

Cite this article

Download citation ▾
Shaowei Sun. Characterization of Graphs with Some Normalized Laplacian Eigenvalue Having Multiplicity $n{-}4$. Communications in Mathematics and Statistics 1-11 DOI:10.1007/s40304-024-00395-5

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

National Natural Science Foundation of China(11901525)

AI Summary AI Mindmap
PDF

194

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/