Trees with very few eigenvalues

DOI10.1002/JGT.3190140415MaRDI QIDQ4713099zbMATH OpenOpenAlexFDO

Authors Robert A. Beezer

Publication date 25 June 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190140415

zbMATH Keywords

adjacency matrixeigenvalues

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Diameter minimal trees
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• The multiplicities of eigenvalues of a graph
• scientific article; zbMATH DE number 2149403

Cited in

(10)

• The multiplicities of eigenvalues of a graph
• Most Laplacian eigenvalues of a tree are small
• Diameter minimal trees
• scientific article; zbMATH DE number 5079740 (Why is no real title available?)
• Trees with Cantor Eigenvalue Distribution
• scientific article; zbMATH DE number 2149403 (Why is no real title available?)
• An explicit upper bound on disparity for trees of a given diameter
• The characterization of the minimal weighted acyclic graphs
• Diminimal families of arbitrary diameter
• Minimal graphs with eigenvalue multiplicity of \(n-d\)

This page was built for publication: Trees with very few eigenvalues

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