Developments on Spectral Characterizations of Graphs

In [E.R. van Dam and 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]  W. Haemers,et al.  Which graphs are determined by their spectrum , 2003 .

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

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

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

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

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

[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]  A. Neumaier,et al.  The graphs with spectral radius between 2 and 2+5 , 1989 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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