On graphs with some normalized Laplacian eigenvalue of extremal multiplicity

preprint2020arXivOpen access

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 ρn−1(G)ρ_{n-1}(G) be the second least eigenvalue of L(G)\mathcal{L}(G). Denote by ν(G)ν(G) the independence number of GG. Recently, the paper [Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity n−3n-3, arXiv:1912.13227] discussed the graphs with some normalized Laplacian eigenvalue of multiplicity n−3n-3. However, there is one remaining case (graphs with ρn−1(G)≠1ρ_{n-1}(G)\neq 1 and ν(G)=2ν(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−3n-3.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.