Trees with 4 or 5 distinct normalized Laplacian eigenvalues

DOI10.1016/j.laa.2015.01.018zbMath1307.05137OpenAlexW2031498676MaRDI QIDQ2261566

Vilmar Trevisan, Renata R. Del-Vecchio, Rodrigo O. Braga, Virgínia M. Rodrigues

Publication date: 6 March 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.01.018

zbMATH Keywords

eigenvalue multiplicitynormalized Laplacian eigenvaluessmall diameter trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Locating eigenvalues of unicyclic graphs ⋮ Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity \(n-3\) ⋮ Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ Locating Eigenvalues of Symmetric Matrices - A Survey ⋮ Locating eigenvalues of unbalanced unicyclic signed graphs

Cites Work

• Graphs whose normalized Laplacian has three eigenvalues
• Locating the eigenvalues of trees
• An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
• An Interlacing Result on Normalized Laplacians
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with 4 or 5 distinct normalized Laplacian eigenvalues