English

On graphs with some normalized Laplacian eigenvalue of extremal multiplicity

Combinatorics 2020-07-24 v1

Abstract

Let GG be a connected simple graph on nn vertices. Let L(G)\mathcal{L}(G) be the normalized Laplacian matrix of GG and ρn1(G)\rho_{n-1}(G) be the second least eigenvalue of L(G)\mathcal{L}(G). Denote by ν(G)\nu(G) the independence number of GG. Recently, the paper [Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity n3n-3, arXiv:1912.13227] discussed the graphs with some normalized Laplacian eigenvalue of multiplicity n3n-3. However, there is one remaining case (graphs with ρn1(G)1\rho_{n-1}(G)\neq 1 and ν(G)=2\nu(G)= 2) 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 n3n-3.

Keywords

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}
}
R2 v1 2026-06-23T17:20:20.601Z