arXiv Analytics

Sign in

arXiv:2007.11844 [math.CO]AbstractReferencesReviewsResources

On graphs with some normalized Laplacian eigenvalue of extremal multiplicity

Fenglei Tian, Junqing Cai, Zuosong Liang, Xuntuan Su

Published 2020-07-23Version 1

Let $G$ be a connected simple graph on $n$ vertices. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$ and $\rho_{n-1}(G)$ be the second least eigenvalue of $\mathcal{L}(G)$. Denote by $\nu(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 $\rho_{n-1}(G)\neq 1$ and $\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 $n-3$.

Related articles: Most relevant | Search more
arXiv:1803.07042 [math.CO] (Published 2018-03-19)
On the $k$-independence number of graphs
arXiv:2009.01286 [math.CO] (Published 2020-09-02)
Charting the space of chemical nut graphs
arXiv:1704.06867 [math.CO] (Published 2017-04-23)
Relation between the skew-rank of an oriented graph and the independence number of its underlying graph