On graphs with some normalized Laplacian eigenvalue of extremal multiplicity
Combinatorics
2020-07-24 v1
Abstract
Let be a connected simple graph on vertices. Let be the normalized Laplacian matrix of and be the second least eigenvalue of . Denote by the independence number of . Recently, the paper [Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity , arXiv:1912.13227] discussed the graphs with some normalized Laplacian eigenvalue of multiplicity . However, there is one remaining case (graphs with and ) not considered. In this paper, we focus on cographs and graphs with diameter 3 to investigate the graphs with some normalized Laplacian eigenvalue of multiplicity .
Cite
@article{arxiv.2007.11844,
title = {On graphs with some normalized Laplacian eigenvalue of extremal multiplicity},
author = {Fenglei Tian and Junqing Cai and Zuosong Liang and Xuntuan Su},
journal= {arXiv preprint arXiv:2007.11844},
year = {2020}
}