Six classes of trees with largest normalized algebraic connectivity
DOI10.1016/J.LAA.2014.03.030zbMATH Open1290.05105OpenAlexW1985241192WikidataQ112882256 ScholiaQ112882256MaRDI QIDQ2451679FDOQ2451679
Authors: Jianxi Li, Jiming Guo, Wai Chee Shiu, An Chang 
Publication date: 4 June 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.03.030
Recommendations
- The six classes of trees with the largest algebraic connectivity
- The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\)
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
- Ordering trees by algebraic connectivity
- On the second minimum algebraic connectivity of the graphs whose complements are trees
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on the normalized Laplacian spectra
- An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
- The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edges
- The six classes of trees with the largest algebraic connectivity
Cited In (8)
- The six classes of trees with the largest algebraic connectivity
- Normalized algebraic connectivity of graphs
- Distance between the normalized Laplacian spectra of two graphs
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
- On the second smallest and the largest normalized Laplacian eigenvalues of a graph
- Characterization of graphs with the limited normalized algebraic connectivity
- The trees with the second smallest normalized Laplacian eigenvalue at least \(1-\frac{\sqrt{3}}{2}\)
- On the second largest normalized Laplacian eigenvalue of graphs
This page was built for publication: Six classes of trees with largest normalized algebraic connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451679)
