In this paper, we construct trees having only integer eigenvalues with arbitrarily large diameters. In fact, we prove that for every finite set S of positive integers there exists a tree whose positive eigenvalues are exactly the elements of S. If the set S is different from the set {1} then the constructed tree will have diameter 2|S|. © 2010 Springer Science+Business Media, LLC.
CITATION STYLE
Csikvári, P. (2010). Integral trees of arbitrarily large diameters. Journal of Algebraic Combinatorics, 32(3), 371–377. https://doi.org/10.1007/s10801-010-0218-8
Mendeley helps you to discover research relevant for your work.