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

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

Authors: A. Dubickas 

Publication date: 31 May 2024

Published in: Combinatorica (Search for Journal in Brave)

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

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)

Cites Work

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

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)