Integral trees of odd diameters
From MaRDI portal
Abstract: A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, Csikvari proved the existence of integral trees of any even diameter. In the odd case, integral trees have been constructed with diameter at most 7. In this paper, we show that for every odd integer n > 1, there are infinitely many integral trees of diameter n.
Recommendations
Cites work
- Balanced integral trees
- scientific article; zbMATH DE number 4137780 (Why is no real title available?)
- scientific article; zbMATH DE number 3666828 (Why is no real title available?)
- scientific article; zbMATH DE number 3672322 (Why is no real title available?)
- scientific article; zbMATH DE number 2042723 (Why is no real title available?)
- scientific article; zbMATH DE number 1744085 (Why is no real title available?)
- Integral trees of arbitrarily large diameters
- On a Diophantine equation arising in graph theory
- Small integral trees
- There are integral trees of diameter 7
Cited in
(16)- Odd or even on plane trees
- Rims of cantor trees
- Irredundance trees of diameter 3
- Integral trees with diameter 6 or 8
- Integral trees homeomorphic to a double star
- There are integral trees of diameter 7
- scientific article; zbMATH DE number 2042723 (Why is no real title available?)
- Integral trees with given nullity
- New class of integral bipartite graphs with large diameter
- Combinatorial Image Analysis
- Integral trees of arbitrarily large diameters
- Turán number for odd‐ballooning of trees
- Integral trees with diameter 6
- Integral trees with diameter four
- Splitting fields of trees
- Spectral deviations of graphs
This page was built for publication: Integral trees of odd diameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897210)