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

DOI10.1080/03081087.2021.1887070OpenAlexW3130574555MaRDI QIDQ5887698FDOQ5887698

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

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

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)

Cites Work

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

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)