Which graphs are determined by their spectrum?

Linear Algebra and Its Applications

Volumn 373, Issue SUPPL., 2003, Pages 241-272

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

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Cospectral graphs; Distance regular graphs; Eigenvalues; Spectra of graphs

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; LAPLACE TRANSFORMS;

DISTANCE-REGULAR GRAPHS;

MATRIX ALGEBRA;

EID: 0141607701     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(03)00483-X     Document Type: Conference Paper

References (68)

1. Berlekamp E.R., van Lint J.H., Seidel J.J. A strongly regular graph derived from the perfect ternary Golay code. Shrivastava J.N. A Survey in Combinatorial Theory. 1973;25-30 North-Holland, Amsterdam.
2. Biggs N.L. Algebraic Graph Theory. 1974;Cambridge University Press.
3. Bose R.C. Strongly regular graphs, partial geometries and partially balanced designs. Pacific J. Math. 13:1963;389-419.
4. Botti P., Merris R. Almost all trees share a complete set of immanantal polynomials. J. Graph Theory. 17:1993;467-476.
5. Brooks R. Non-Sunada graphs. Ann. Inst. Fourier (Grenoble). 49:1999;707-725.
6. Brouwer A.E. The uniqueness of the strongly regular graph on 77 points. J. Graph Theory. 7:1983;455-461.
7. Brouwer A.E. Strongly regular graphs. Colbourn C.J., Denitz J.H. The CRC Handbook of Combinatorial Designs. 1996;667-685 CRC Press.
8. Brouwer A.E., Cohen A.M., Neumaier A. Distance-Regular Graphs. 1989;Springer, Heidelberg.
9. Brouwer A.E., Haemers W.H. The Gewirtz graph: An exercise in the theory of graph spectra. European J. Combin. 14:1993;397-407.
10. Brouwer A.E., Haemers W.H. Structure and uniqueness of the (. 81,20,1,6 ) strongly regular graph Discrete Math. 106/107:1992;77-82.
11. Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory. 1991;Cambridge University Press.
12. F.C. Bussemaker, D.M. Cvetković, J.J. Seidel, Graphs related to exceptional root systems, T.H.-Report 76-WSK-05, Eindhoven University of Technology, 1976.
13. Cameron P.J., Goethals J.M., Seidel J.J. Strongly regular graph having strongly regular subconstituents. J. Algebra. 55:1978;257-280.
14. Cameron P.J., Goethals J.M., Seidel J.J., Shult E.E. Line graphs, root systems, and elliptic geometry. J. Algebra. 43:1976;305-327.
15. 2=4 Sci. Record. 4:1960;12-18.
16. F.R.K. Chung, Spectral Graph Theory, AMS, Providence, RI, 1994.
17. Collatz L., Sinogowitz U. Spektren endlicher Grafen. Abh. Math. Sem. Univ. Hamburg. 21:1957;63-77.
18. K. Coolsaet, J. Degraer, A computer assisted proof of the uniqueness of the Perkel graph, Designs, Codes and Cryptography, in press.
19. Cvetković D.M. Graphs and their spectra. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 354-356:1971;1-50.
20. Cvetković D.M. Constructing trees with given eigenvalues and angles. Linear Algebra Appl. 105:1988;1-8.
21. D.M. Cvetković, M. Doob, Root systems, forbidded subgraphs and spectral characterizations of line graphs, in: Cvetković, Gutman, Pisanski, Tošić (Eds.) Graph Theory, Proc. Fourth Yugoslav Sem. Graph Theory, Novi Sad, 1983, pp. 69-99.
22. D.M. Cvetković, M. Doob, I. Gutman, A. Torgašev, Recent Results in the Theory of Graph Spectra, in: Annals of Discrete Mathematics, vol. 36, North-Holland, Amsterdam, 1988.
23. Cvetković D.M., Doob M., Sachs H. Spectra of Graphs. first edition: Deutscher Verlag der Wissenschaften, Berlin, 1980; Academic Press, New York, 1980 third ed. 1995;Johann Abrosius Barth Verlag.
24. D.M. Cvetković, P. Rowlinson, S. Simić, Spectral generalizations of line graphs; a research monograph on graphs with least eigenvalue -2, manuscript.
25. van Dam E.R. Regular graphs with four eigenvalues. Linear Algebra Appl. 226-228:1995;139-162.
26. van Dam E.R. Nonregular graphs with three eigenvalues. J. Combin. Theory B. 73:1998;101-118.
27. van Dam E.R., Haemers W.H. Graphs with constant. μ and μ Discrete Math. 182:1998;293-307.
28. van Dam E.R., Haemers W.H. Spectral characterizations of some distance-regular graphs. J. Algebra Combin. 15:2002;189-202.
29. E.R. van Dam, J.H. Koolen, private communication.
30. van Dam E.R., Spence E. Small regular graphs with four eigenvalues. Discrete Math. 189:1998;233-257.
31. E.R. van Dam, E. Spence, Combinatorial designs with two singular values I. Uniform multiplicative designs, in preparation.
32. Doob D.M. Seidel switching and cospectral graphs with four distinct eigenvalues. Ann. New York Acad. Sci. 319:1979;164-168.
33. Doob M., Haemers W.H. The complement of the path is determined by its spectrum. Linear Algebra Appl. 356:2002;57-65.
34. Fiol M.A., Garriga E. From local adjacency polynomials to locally pseudo-distance-regular graphs. J. Combin. Theory B. 71:1997;162-183.
35. Fisher M. On hearing the shape of a drum. J. Combin. Theory. 1:1966;105-125.
36. Fujii H., Katsuda A. Isospectral graphs and isoperimetric constants. Discrete Math. 207:1999;33-52.
37. Gewitz A. Graphs with maximal even girth. Canad. J. Math. 21:1969;915-934.
38. Godsil C.D. Algebraic Combin. 1993;Chapman & Hall.
39. Godsil C.D., McKay B.D. Some computational results on the spectra of graphs. Casse L.R.A., Wallis W.D. Combinatorial Mathematics IV (Proceedings of the Fourth Australian Conference on Combinatorial Mathematics, Adelaide). Lecture Notes in Mathematics. vol. 560:1976;73-92 Springer-Verlag, Berlin.
40. Godsil C.D., McKay B.D. Constructing cospectral graphs. Aequationes Math. 25:1982;257-268.
41. Goethals J.M., Seidel J.J. The regular two-graph on 276 vertices. Discrete Math. 12:1975;143-158.
42. Günthard Hs.H., Primas H. Zusammenhang von Graphentheorie und MO-Theorie von Molekeln mit Systemen konjugierter Bindungen. Helv. Chim. Acta. 39:1956;1645-1653.
43. Haemers W.H. Distance-regularity and the spectrum of graphs. Linear Algebra Appl. 236:1996;265-278.
44. Haemers W.H., Spence E. Graphs cospectral with distance-regular graphs. Linear and Multilinear Algebra. 39:1995;91-107.
45. W.H. Haemers, E. Spence, Enumeration of cospectral graphs, European J. Combin., in press. Also: Center discussion paper 2002-90, Tilburg University.
46. W.H. Haemers, E. Spence, Enumeration of cospectral graphs, European J. Combin., in press. Also: Center discussion paper 2002-90, Tilburg University.
47. Halbeisen L., Hungerbühler N. Generation of isospectral graphs. J. Graph Theory. 31:1999;255-265.
48. Halbeisen L., Hungerbühler N. Reconstruction of weighted graphs by their spectrum. European J. Combin. 21:2000;641-650.
49. Hoffman A.J. On the polynomial of a graph. Amer. Math. Monthly. 70:1963;30-36.
50. Huang T., Liu C. Spectral characterization of some generalized odd graphs. Graphs Combin. 15:1999;195-209.
51. Johnson C.R., Newman M. A note on cospectral graphs. J. Combin. Theory B. 28:1980;96-103.
52. Kac M. Can one hear the shape of a drum? Amer. Math. Monthly. 73:1966;1-23.
53. Lepović M., Gutman I. No starlike trees are cospectral. Discrete Math. 242:2002;291-295.
54. J.H. van Lint, J.J. Seidel, Equilateral point sets in elliptic geometry, Proc. Nederl. Akad. Wetenschappen A 69 (1966) 335-348.
55. Lubotzky A. Cayley graphs: eigenvalues, expanders and random walks. in: Surveys in Combinatorics, 1995 (Stirling). London Math. Soc. Lecture Note Ser. vol. 218:1995;155-189 Cambridge University Press, Cambridge.
56. McKay B.D. On the spectral characterisation of trees. Ars Combin. 3:1979;219-232.
57. McKay B.D., Spence E. Classification of regular two-graphs on 36 and 38 vertices. Austral. J. Combin. 24:2001;293-300.
58. Merris R. Large families of Laplacian isospectral graphs. Linear and Multilinear Algebra. 43:1997;201-205.
59. Payne S.E., Thas J.A. Finite Generalized Quadrangles. 1984;Pitman, London.
60. Rowlinson P. The characteristic polynomials of modified graphs. Discrete Appl. Math. 67:1996;209-219.
61. H. Sachs, Über Teiler, Faktoren und charakteristische Polynome von Graphen, Teil II, Wiss. Z. TH Ilmenau 13 (1967) 405-412.
62. Schwenk A.J. Almost all trees are cospectral. Harary F. New Directions in the Theory of Graphs. 1973;275-307 Academic Press, New York.
63. Seidel J.J. Strongly regular graphs with (. -1,1,0 ) adjacency matrix having eigenvalue 3 Linear Algebra Appl. 1:1968;198-281.
64. J.J. Seidel, Graphs and two-graphs, in: F. Hoffman et al. (Eds.) Proc. 5th Southeast. Conf. Comb., Graph Th., Comp., Utilitas Mathematica Pub., Winnipeg, 1974, pp. 125-143.
65. J.J. Seidel, A survey of two-graphs, in: Teorie Combinatorie (Proc. Intern. Coll., Roma 1973), Accad. Nac. Lincei, Roma, 1976, pp. 481-511.
66. Seress Á. Large families of cospectral graphs. Designs, Codes and Cryptography. 21:2000;205-208.
67. 2 association scheme Ann. Math. Statist. 30:1959;781-798.
68. Whitney H. Congruent graphs and the connectivity of graphs. Amer. J. Math. 54:1932;150-167.