Balanced integral trees
From MaRDI portal
A graph \(G\) is called integral if all the zeros of its characteristic polynomial \(P(G,\lambda)\) are integers. A tree \(T\) is said to be balanced if all vertices of the same distance from the centre \(Z(T)\) of \(T\) are of the same degree. The authors give a survey of known results and present some new results on balanced integral trees. They prove that there are infinitely many balanced integral trees of diameter \(8\), however there is no balanced integral tree of diameter \(7\) and \(4k+1\) for \(k\geq 1\).
Recommendations
Cited in
(18)- Families of integral trees with diameters 4, 6, and 8.
- Construction of integral graphs
- Integral complete \(r\)-partite graphs
- Integral trees of diameter 6
- Integral trees with diameters 5 and 6
- Integral trees of odd diameters
- On the real roots of \(\sigma\)-polynomials
- Balanced ordered trees
- scientific article; zbMATH DE number 936882 (Why is no real title available?)
- Rank-Balanced Trees
- Locating the eigenvalues of trees
- Integral trees with diameter four
- The spectrum of symmetric decorated paths
- On non-bipartite graphs with integral signless Laplacian eigenvalues at most 6
- Integral circulant graphs
- Integral complete 4-partite graphs
- The integral trees with spectral radius 3
- Some families of integral graphs
This page was built for publication: Balanced integral trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702772)
