On graphs with some normalized Laplacian eigenvalue of extremal multiplicity

arXiv2007.11844MaRDI QIDQ6345683FDOQ6345683

Fenglei Tian, Xuntuan Su, Zuosong Liang, Junqing Cai

Publication date: 23 July 2020

Abstract: Let $G$ be a connected simple graph on $n$ vertices. Let $mathcalL(G)$ be the normalized Laplacian matrix of $G$ and $h{o}_{n-1}(G)$ be the second least eigenvalue of $mathcalL(G)$. Denote by $u(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 $h{o}_{n-1}(G)eq1$ and $u(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$.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

This page was built for publication: On graphs with some normalized Laplacian eigenvalue of extremal multiplicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345683)