An explicit upper bound on disparity for trees of a given diameter

DOI10.1080/03081087.2021.1887070MaRDI QIDQ5887698zbMATH OpenOpenAlexFDO

Authors Isaac Cinzori, Charles R. Johnson, Hannah Lang

Publication date 13 April 2023

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

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

zbMATH Keywords

graph of a matrixseeddistinct eigenvaluesbranch duplicationrooted seed

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42)

Recommendations

• Diameter minimal trees
• Unordered multiplicity lists of a class of binary trees
• Diminimal families of arbitrary diameter
• Trees with very few eigenvalues
• The multiplicities of eigenvalues of a graph

Cites work

• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
• Branch duplication in trees: uniqueness of seeds and enumeration of seeds
• Diameter minimal trees
• Eigenvalues, multiplicities and graphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Minimum number of distinct eigenvalues of graphs
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree

Cited in

(3)

• Diameter minimal trees
• Diminimal families of arbitrary diameter
• Measuring the external branches of a Kingman tree: a discrete approach

This page was built for publication: An explicit upper bound on disparity for trees of a given diameter

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