On graphs with some normalized Laplacian eigenvalue of extremal multiplicity

Abstract

Let G be a connected simple graph on n vertices. Let L(G) be the normalized Laplacian matrix of G and n-1(G) be the second least eigenvalue of L(G). Denote by (G) the independence number of G. Recently, the paper [Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity n-3, arXiv:1912.13227] discussed the graphs with some normalized Laplacian eigenvalue of multiplicity n-3. However, there is one remaining case (graphs with n-1(G)≠ 1 and (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 n-3.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…