On graphs with three or four distinct normalized Laplacian eigenvalues
Combinatorics
2017-03-28 v2
Abstract
In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to , determine all connected bipartite graphs with at least one vertex of degree having exactly four distinct normalized Laplacian eigenvalues, and find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues.
Cite
@article{arxiv.1611.05311,
title = {On graphs with three or four distinct normalized Laplacian eigenvalues},
author = {Xueyi Huang and Qiongxiang Huang},
journal= {arXiv preprint arXiv:1611.05311},
year = {2017}
}
Comments
17 pages, 1 figure