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.











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)