Developments on spectral characterizations of graphs

Discrete Mathematics

Volumn 309, Issue 3, 2009, Pages 576-586

  van Dam, Edwin R ^a   Haemers, Willem H ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Cospectral graphs; Distance regular graphs; Generalized adjacency matrices; Spectra of graphs

Indexed keywords

ALGEBRA; SPECTRUM ANALYZERS;

COSPECTRAL GRAPHS; DISTANCE-REGULAR GRAPHS; GENERALIZED ADJACENCY MATRICES; LAPLACIAN MATRICES; MATRIXES; RESEARCH QUESTIONS; SPECTRA OF GRAPHS; SPECTRAL CHARACTERIZATIONS;

SURVEYS;

EID: 59649130014     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.08.019     Document Type: Article

References (45)

1. S. Bang, E.R. van Dam, J.H. Koolen, Spectral characterization of the Hamming graphs, Linear Algebra Appl., doi:10.1016/j.laa.2007.10.026
2. Bang S., and Koolen J.H. Graphs cospectral with H (3, q) which are locally disjoint union of at most three complete graphs. Asian-European J. Math. 1 (2008) 147-156
3. Boulet R., and Jouve B. The Lollipop Graph is determined by its spectrum. Electron. J. Combin. 15 (2008) R74
4. Brouwer A.E., and Neumaier A. The graphs with spectral radius between 2 and sqrt(2 + sqrt(5)). Linear Algebra Appl. 114/115 (1989) 273-276
5. Bussemaker F.C., Haemers W.H., and Spence E. The search for pseudo orthogonal Latin squares of order six. Des. Codes Cryptogr. 21 (2000) 77-82
6. Cameron P.J. Random strongly regular graphs?. Discrete Math. 273 (2003) 103-114
7. Cameron P.J. Strongly regular graphs. In: Beineke L.W., and Wilson R.J. (Eds). Topics in Algebraic Graph Theory (2004), Cambridge Univ. Press 203-221
8. Chesnokov A.A., and Haemers W.H. Regularity and the generalized adjacency spectra of graphs. Linear Algebra Appl. 416 (2006) 1033-1037
9. Chowla S., Erdös P., and Straus E.G. On the maximal number of orthogonal Latin squares of a given order. Canad. J. Math. 12 (1960) 204-208
10. Coolsaet K. The uniqueness of the strongly regular graph srg(105,32,4,12). Bull. Belg. Math. Soc. Simon Stevin 12 (2005) 707-718
11. Cvetković D.M., Doob M., and Sachs H. Spectra of Graphs. third ed. (1995), Johann Ambrosius Barth Verlag Deutscher Verlag der Wissenschaften, first ed. Berlin 1980; Academic Press, New York, 1980
12. Cvetković D.M., Rowlinson P., and Simić S. Signless Laplacians of finite graphs. Linear Algebra Appl. 423 (2007) 155-171
13. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 373 (2003) 241-272
14. van Dam E.R., Haemers W.H., and Koolen J.H. Cospectral graphs and the generalized adjacency matrix. Linear Algebra Appl. 423 (2007) 33-41
15. van Dam E.R., Haemers W.H., Koolen J.H., and Spence E. Characterizing distance-regularity of graphs by the spectrum. J. Combin. Theory A 113 (2006) 1805-1820
16. van Dam E.R., and Koolen J.H. A new family of distance-regular graphs with unbounded diameter. Invent. Math. 162 (2005) 189-193
17. van Dam E.R., and Spence E. Combinatorial designs with two singular values. I. Uniform multiplicative designs. J. Combin. Theory. A 107 (2004) 127-142
18. van Dam E.R., and Spence E. Combinatorial designs with two singular values. II. Partial geometric designs. Linear Algebra Appl. 396 (2005) 303-316
19. J. Degraer, Isomorph-free exhaustive generation algorithms for association schemes, Thesis, Ghent University, 2007
20. Degraer J., and Coolsaet K. Classification of some strongly regular subgraphs of the McLaughlin graph. Discrete Math. 308 (2008) 395-400
21. Fon-Der-Flaass D.G. New prolific constructions of strongly regular graphs. Adv. Geom. 2 (2002) 301-306
22. Ghareghani N., Omidi G.R., and Tayfeh-Rezaie B. Spectral characterization of graphs with index at most sqrt(2 + sqrt(5)). Linear Algebra Appl. 420 (2007) 483-489
23. Godsil C.D., and McKay B.D. Constructing cospectral graphs. Aequationes Math. 25 (1982) 257-268
24. Godsil C.D., and McKay B.D. Products of graphs and their spectra. In: Casse L.R.A., and Wallis W.D. (Eds). Combinatorial Mathematics IV. Lecture Notes in Mathematics vol. 560 (1976), Springer, Berlin 61-72
25. Haemers W.H., Liu X., and Zhang Y. Spectral characterizations of lollipop graphs. Linear Algebra Appl. 428 (2008) 2415-2423
26. Haemers W.H., and Spence E. Enumeration of cospectral graphs. European. J. Combin. 25 (2004) 199-211
27. Hagos E.M. Some results on graph spectra. Linear Algebra Appl. 356 (2002) 103-111
28. Hammer P.L., and Kelmans A.K. Laplacian spectra and spanning trees of threshold graphs. Discrete Appl. Math. 65 (1996) 255-273
29. Johnson C.R., and Newman M. A note on cospectral graphs. J. Combin. Theory. B 28 (1980) 96-103
30. Lepović M. Some results on starlike trees and sunlike graphs. J. Appl. Math. Comput. 11 (2003) 109-123
31. Lepović M., and Gutman I. No starlike trees are cospectral. Discrete Math. 242 (2002) 292-295
32. Liu X., Zhang Y., and Gui X. The multi-fan graphs are determined by their Laplacian spectra. Discrete Math. 308 (2008) 4267-4271
33. Muzychuk M. A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs. J. Algebraic Combin. 25 (2007) 169-187
34. Neumaier A. Strongly regular graphs with smallest eigenvalue - m. Arch. Math. 33 (1979) 391-400
35. Omidi G.R., and Tajbakhsh K. Starlike trees are determined by their Laplacian spectrum. Linear Algebra Appl. 422 (2007) 654-658
36. n are determined by their spectrum. Linear Algebra Appl. 404 (2005) 58-68
37. Smith J.H. Some properties of the spectrum of a graph. In: Guy R., et al. (Ed). Combinatorial Structures and their Applications (Proc. Conf. Calgary, 1969) (1970), Gordon and Breach, New York 403-406
38. Stevanović D. Research problems from the Aveiro Workshop on Graph Spectra. Linear Algebra Appl. 423 (2007) 172-181
39. Vu V.H. On the embedding of graphs into graphs with few eigenvalues. J. Graph Theory 22 (1996) 137-149
40. Wang W., and Xu C.-X. A sufficient condition for a family of graphs being determined by their generalized spectra. European J. Combin. 27 (2006) 826-840
41. Wang W., and Xu C.-X. On the spectral characterization of T-shape trees. Linear Algebra Appl. 414 (2006) 492-501
42. Wang W., and Xu C.-X. An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra. Linear Algebra Appl. 418 (2006) 62-74
43. Wang W., and Xu C.-X. Note: On the generalized spectral characterization of graphs having an isolated vertex. Linear Algebra Appl. 425 (2007) 210-215
44. Wilson R.M. An existence theory for pairwise balanced designs, III: Proof of the existence conjectures. J. Combin. Theory A 18 (1975) 71-79
45. Woo R., and Neumaier A. On graphs whose spectral radius is bounded by frac(3, 2) sqrt(2). Graphs Combin. 23 (2007) 713-726