Location of Repository

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, Csikvári 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

Topics:
Integral tree, Adjacency eigenvalue, Diameter

Year: 2011

OAI identifier:
oai:CiteSeerX.psu:10.1.1.185.4111

Provided by:
CiteSeerX

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.