Download This PaperThe Integral Trees With Spectral Radius 3
CentER Discussion Paper No. 2007-84
10 Pages Posted: 29 Oct 2007
Date Written: October 2007
Abstract
There are eleven integral trees with largest eigenvalue 3.
Keywords: Integral graphs, graph spectra, trees
JEL Classification: C0
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
On 3-Chromatic Distance-Regular Graphs
By Aart Blokhuis, Andries E. Brouwer, ...
-
Combinatorial Designs with Two Singular Values Ii. Partial Geometric Designs
By Edwin Van Dam and E. Spence
-
Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs
By Edwin Van Dam and E. Spence
-
Spectral Characterization of the Hamming Graphs
By Sejeong Bang, Edwin Van Dam, ...
-
Some Implications on Amorphic Association Schemes
By Edwin Van Dam and Mikhail Muzychuk
-
Strongly Regular Graphs with Parameters (4m^4, 2m^4 + m^2, m^4 + m^2, m^4 + m2) Exist for All m>1
By Willem H. Haemers and Qing Xiang
-
By Edwin Van Dam, William Martin, ...
-
An Odd Characterization of the Generalized Odd Graphs
By Edwin Van Dam and Willem H. Haemers