Diameter minimal trees

DOI10.1080/03081087.2015.1057097MaRDI QIDQ2787616zbMATH OpenOpenAlexFDO

Authors Charles R. Johnson, Carlos M. Saiago

Publication date 4 March 2016

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2015.1057097

zbMATH Keywords

branch duplicationdiameterdistinct eigenvaluesHermitian matrixmultiplicities

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Diminimal families of arbitrary diameter
• Trees with very few eigenvalues
• On minimal energies of trees of a prescribed diameter
• An explicit upper bound on disparity for trees of a given diameter
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree

Cites work

• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
• Construction of acyclic matrices from spectral data
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• Partial pole assignment for the vibrating system with aerodynamic effect
• Smith normal form and acyclic matrices
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization
• The structure of matrices with a maximum multiplicity eigenvalue

Cited in

(17)

• Geometric Parter-Wiener, etc. theory
• The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
• Change in vertex status after removal of another vertex in the general setting
• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
• Approximate minimum diameter
• scientific article; zbMATH DE number 6391329 (Why is no real title available?)
• Questions, conjectures, and data about multiplicity lists for trees
• Branch duplication in trees: uniqueness of seeds and enumeration of seeds
• scientific article; zbMATH DE number 3957503 (Why is no real title available?)
• scientific article; zbMATH DE number 1979696 (Why is no real title available?)
• A KNOTTED MINIMAL TREE
• Trees with very few eigenvalues
• 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
• On the minimum number of eigenvalues of trees of diameter seven
• The number of distinct eigenvalues for which an index decreases multiplicity

This page was built for publication: Diameter minimal trees

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