Spectral characterization of the Hamming graphs

Linear Algebra and Its Applications

Volumn 429, Issue 11-12, 2008, Pages 2678-2686

  Bang, Sejeong ^a   van Dam, Edwin R ^b   Koolen, Jack H ^c  

^a Pusan National University   (South Korea)

^b TILBURG UNIVERSITY   (Netherlands)

^c Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Cospectral graphs; Distance regular graphs; Eigenvalues; Geometric graphs; Hamming graphs; Spectrum of a graph

Indexed keywords

SPECTRUM ANALYZERS;

COMPLETE GRAPHS; COSPECTRAL GRAPHS; DISTANCE-REGULAR GRAPHS; EIGENVALUES; GEOMETRIC GRAPHS; HAMMING GRAPHS; SPECTRAL CHARACTERIZATION; SPECTRUM OF A GRAPH;

GRAPH THEORY;

EID: 52349095992     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2007.10.026     Document Type: Article

References (10)

1. S. Bang, J.H. Koolen, Graphs cospectral with H (3, q) which are locally disjoint union of at most three complete graphs, submitted for publication.
2. Biggs N. Algebraic Graph Theory, Cambridge Tracts in Mathematics vol. 67 (1974), Cambridge University Press, London
3. Brouwer A.E., Cohen A.M., and Neumaier A. Distance-Regular Graphs (1989), Springer-Verlag, Berlin
4. van Dam E.R., Haemers W.H., Koolen J.H., and Spence E. Characterizing distance-regularity of graphs by the spectrum. J. Combinatorial Th. A 113 (2006) 1805-1820
5. Haemers W.H., and Spence E. Graphs cospectral with distance-regular graphs. Linear Multilin. Alg. 39 (1995) 91-107
6. Hoffman A.J. On the polynomial of a graph. Amer. Math. Monthly 70 (1963) 30-36
7. Mantel W. Vraagstuk XXVIII. Wiskundige Opgaven met de Oplossingen 10 (1907) 60-61
8. Metsch K. Improvement of Bruck's completion theorem. Designs Codes Crypt. 1 (1991) 99-116
9. Metsch K. A characterization of Grassmann graphs. European J. Combin. 16 (1995) 639-644
10. Douglas B. West, Introduction to Graph Theory (1996), Prentice Hall, Inc., Upper Saddle River, NJ