Solving the problem about the second largest normalized Laplacian eigenvalue
Let \(G\) be a simple graph of order \(n\). Let \(A(G)\) be the adjacency matrix of \(G\) and \(D(G)\) be the diagonal degree matrix of \(G\). The normalized Laplacian matrix of \(G\) is the matrix \[\mathcal{L}(G)=D^{-\frac{1}{2}}(G)(D(G)-A(G))D^{-\frac{1}{2}}(G).\] Let \(\rho_1(G)\geq \rho_2(G)\geq\dots\geq \rho_n(G)=0\) be the eigenvalues of \(\mathcal{L}(G)\).\N\NIn this paper, the authors characterize all connected graphs \(G\) of order \(n\) such that \(\rho_2(G)=\frac{n-1}{n-2}\). The main result is Theorem 1.2 and Section 3 is its proof.\N\NFirst, they characterize all connected graphs \(G\) with \(n\geq 5\) vertices, having a path with \(4\) vertices as an induced graph of \(G\) such that \(\rho_2(G)=\frac{n-1}{n-2}\) (see Theorem 3.6). Then, they characterize all connected graphs \(G\) with \(n\geq 6\) vertices, without a path with \(4\) vertices as an induced graph of \(G\), but such that \(\rho_2(G)=\frac{n-1}{n-2}\) (see Theorem 3.12).\N\NThe proof of Theorems 3.6 and 3.12 are long so the authors divide it into several results. Therefore, the paper is easy to read and contains important and interesting results that will be used by other researchers.\N\NIn my opinion, this paper is the first of other works on this matter.
- An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
- An introduction to the theory of graph spectra
- Bounding the sum of powers of normalized Laplacian eigenvalues of a graph
- Bounds on normalized Laplacian eigenvalues of graphs
- Extremal normalized Laplacian spectral radii of graphs
- Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity n-3
- Graph theory
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- Normalized Laplacian eigenvalues and energy of trees
- On the second largest normalized Laplacian eigenvalue of graphs
- On the spectrum of an equitable quotient matrix and its application
- Six classes of trees with largest normalized algebraic connectivity
This page was built for publication: Solving the problem about the second largest normalized Laplacian eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7011778)
