Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity n - 3

From MaRDI portal
Publication:2199348



Abstract: Graphs with few distinct eigenvalues have been investigated extensively. In this paper, we focus on another relevant topic: characterizing graphs with some eigenvalue of large multiplicity. Specifically, the normalized Laplacian matrix of a graph is considered here. Let hon−1(G) and u(G) be the second least normalized Laplacian eigenvalue and the independence number of a graph G, respectively. As the main conclusions, two families of n-vertex connected graphs with some normalized Laplacian eigenvalue of multiplicity n−3 are determined: graphs with hon−1(G)=−1 and graphs with hon−1(G)eq−1 and u(G)eq2. Moreover, it is proved that these graphs are determined by their spectrum.











This page was built for publication: Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)

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