An upper bound for the height of a tree with a given eigenvalue
From MaRDI portal
Publication:6548019
DOI10.1007/S00493-023-00071-2MaRDI QIDQ6548019
Publication date: 31 May 2024
Published in: Combinatorica (Search for Journal in Brave)
Trees (05C05) Free semigroups, generators and relations, word problems (20M05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Algebraic numbers; rings of algebraic integers (11R04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of graphs
- Eigenvalues of symmetric integer matrices
- Eigenvalues of symmetric matrices and graphs
- Note on graphs with irreducible characteristic polynomials
- On the spectrum of the perfect matching derangement graph
- A note on the multiplicities of the eigenvalues of a tree
- On the multiplicity of positive eigenvalues of a graph
- Every totally real algebraic integer is a tree eigenvalue
- From among 𝑛 conjugate algebraic integers, 𝑛-1 can be approximately given
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)
