An upper bound for the height of a tree with a given eigenvalue

DOI10.1007/S00493-023-00071-2MaRDI QIDQ6548019FDO

Authors A. Dubickas

Publication date 31 May 2024

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

treeeigenvalueadditive semigrouptotally positive algebraic number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Algebraic numbers; rings of algebraic integers (11R04) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• Every totally real algebraic integer is a tree eigenvalue
• A result related to the largest eigenvalue of a tree
• The kth largest eigenvalue of a tree
• Sharp lower bounds on the eigenvalues of trees
• On the largest eigenvalues of trees

Cites work

• scientific article; zbMATH DE number 3556150 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• A note on the multiplicities of the eigenvalues of a tree
• Eigenvalues of symmetric integer matrices
• Eigenvalues of symmetric matrices and graphs
• Every totally real algebraic integer is a tree eigenvalue
• From among 𝑛 conjugate algebraic integers, 𝑛-1 can be approximately given
• Note on graphs with irreducible characteristic polynomials
• On the multiplicity of positive eigenvalues of a graph
• On the spectrum of the perfect matching derangement graph
• Spectra of graphs
• The main eigenvalues of a graph: a survey

This page was built for publication: An upper bound for the height of a tree with a given eigenvalue

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