Developments on Spectral Characterizations of Graphs

In [E.R. van Dam, W.H. Haemers, Which graphs are determined by their spectrum? Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph. In particular, the usual adjacency matrix and the Laplacian matrix were addressed. Furthermore, we formulated some research questions on the topic. In the meantime, some of these questions have been (partially) answered. In the present paper we give a survey of these and other developments.

[1]  Peter J. Cameron,et al.  Strongly regular graphs , 2003 .

[2]  Brendan D. McKay,et al.  Products of graphs and their spectra , 1976 .

[3]  A. Neumaier.  Strongly regular graphs with smallest eigenvalue —m , 1979 .

[4]  L. Beineke,et al.  Topics in algebraic graph theory , 2004 .

[5]  Elias M. Hagos.  Some results on graph spectra , 2002 .

[6]  Willem H. Haemers,et al.  Enumeration of cospectral graphs , 2004, Eur. J. Comb..

[7]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory A.

[8]  Xiaogang Liu,et al.  The multi-fan graphs are determined by their Laplacian spectra , 2008, Discret. Math..

[9]  Kris Coolsaet.  The uniqueness of the strongly regular graph $\mathrm{srg}(105,32,4,12)$ , 2006 .

[10]  Paul Erdös,et al.  On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order , 1960, Canadian Journal of Mathematics.

[11]  Michael Doob,et al.  Spectra of graphs , 1980 .

[12]  Kris Coolsaet,et al.  Classification of some strongly regular subgraphs of the McLaughlin graph , 2008, Discret. Math..

[13]  D. Cvetkovic,et al.  Signless Laplacians of finite graphs , 2007 .

[14]  Peter J. Cameron,et al.  Random strongly regular graphs? , 2001, Electron. Notes Discret. Math..

[15]  Bertrand Jouve,et al.  The Lollipop Graph is Determined by its Spectrum , 2008, Electron. J. Comb..

[16]  Willem H. Haemers,et al.  Regularity and the Generalized Adjacency Spectra of Graphs , 2005 .

[17]  W. Kantor,et al.  New prolific constructions of strongly regular graphs , 2002 .

[18]  A. Neumaier,et al.  The graphs with spectral radius between 2 and 2+5 , 1989 .

[19]  Yuanping Zhang,et al.  Spectral characterizations of lollipop graphs , 2008 .

[20]  Yuanping Zhang,et al.  Graph Zn and some graphs related to Zn are determined by their spectrum , 2005 .

[21]  W. Haemers,et al.  Which graphs are determined by their spectrum , 2003 .

[22]  Wei Wang,et al.  On the spectral characterization of T-shape trees , 2006 .

[23]  Van H. Vu,et al.  On the embedding of graphs into graphs with few eigenvalues , 1996, J. Graph Theory.

[24]  Dragan Stevanović,et al.  Research problems from the Aveiro Workshop on Graph Spectra , 2007 .

[25]  Arnold Neumaier,et al.  On Graphs Whose Spectral Radius is Bounded by $$\frac{3}{2}\sqrt{2}$$ , 2007, Graphs Comb..

[26]  Willem H. Haemers,et al.  Characterizing distance-regularity of graphs by the spectrum , 2006, J. Comb. Theory, Ser. A.

[27]  Mirko Lepovic,et al.  No starlike trees are cospectral , 2002, Discret. Math..

[28]  E. Spence,et al.  Combinatorial Designs with Two Singular Values Ii. Partial Geometric Designs , 2005 .

[29]  Alexander K. Kelmans,et al.  Laplacian Spectra and Spanning Trees of Threshold Graphs , 1996, Discret. Appl. Math..

[30]  Wei Wang,et al.  A sufficient condition for a family of graphs being determined by their generalized spectra , 2006, Eur. J. Comb..

[31]  S. Bang,et al.  GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS , 2008 .

[32]  Willem H. Haemers,et al.  Spectra of Graphs , 2011 .

[33]  Sejeong Bang,et al.  Spectral Characterization of the Hamming Graphs , 2007 .

[34]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures , 1975, J. Comb. Theory, Ser. A.

[35]  Willem H. Haemers,et al.  Cospectral Graphs and the Generalized Adjacency Matrix , 2006 .

[36]  Mirko Lepović.  Some results on starlike trees and sunlike graphs , 2003 .

[37]  Wei Wang,et al.  Note: On the generalized spectral characterization of graphs having an isolated vertex , 2007 .

[38]  Charles R. Johnson,et al.  A note on cospectral graphs , 1980, J. Comb. Theory, Ser. B.

[39]  K. Tajbakhsh,et al.  Starlike trees are determined by their Laplacian spectrum , 2007 .

[40]  B. McKay,et al.  Constructing cospectral graphs , 1982 .

[41]  Willem H. Haemers,et al.  The Search for Pseudo Orthogonal Latin Squares of Order Six , 2000, Des. Codes Cryptogr..

[42]  Wei Wang,et al.  An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra , 2006 .

[43]  Changan.  SOME PROPERTIES OF THE SPECTRUM OF GRAPHS , 1999 .

[44]  Edward Spence,et al.  Combinatorial designs with two singular values--I: uniform multiplicative designs , 2004, J. Comb. Theory, Ser. A.

[45]  Behruz Tayfeh-Rezaie,et al.  Spectral characterization of graphs with index at most 2+5 , 2007 .

[46]  Mikhail Muzychuk.  A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs , 2007 .

[47]  Jack H. Koolen,et al.  A New Family of Distance-Regular Graphs with Unbounded Diameter , 2005 .