Characterization of graphs with the limited normalized algebraic connectivity
From MaRDI portal
Recommendations
- Normalized algebraic connectivity of graphs
- On the normalized Laplacian eigenvalues of graphs.
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity n-3
- On the second largest normalized Laplacian eigenvalue of graphs
Cites work
- Bounds on normalized Laplacian eigenvalues of graphs
- Difference graphs
- Graph theory with applications
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Normalized Laplacian eigenvalues and energy of trees
- On the second largest normalized Laplacian eigenvalue of graphs
- Quasi-threshold graphs
- Six classes of trees with largest normalized algebraic connectivity
- The Comparability Graph of a Tree
- The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
- The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\)
- Über eine Klasse von Mittelbildungen mit Anwendungen auf die Determinantentheorie.
This page was built for publication: Characterization of graphs with the limited normalized algebraic connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657262)