Spectral Characterization of Some Cubic Graphs
Original Paper
First Online:
Received:
Revised:
- 147 Downloads
- 3 Citations
Abstract
It is proved that the Cartesian product of an odd cycle with the complete graph on 2 vertices, is determined by the spectrum of the adjacency matrix. We also present some computational results on the spectral characterization of cubic graphs on at most 20 vertices.
Keywords
Cartesian product of graphs Eigenvalues Spectral characterizationMathematics Subject Classification (2010)
05C50Preview
Unable to display preview. Download preview PDF.
References
- 1.Bang S., van Dam E.R., Koolen J.H.: Characterization of the Hamming graphs. Linear Algebra Appl. 429, 2678–2686 (2008)MathSciNetMATHCrossRefGoogle Scholar
- 2.Boulet, R., Jouve, B.: The lollipop graph is determined by its spectrum, Electron. J. Combin. 15 (2008, Research Paper 74)Google Scholar
- 3.Cvetković D.M., Doob M., Sachs H.: Spectra of graphs, theory and applications, 3rd edn. Johann Ambrosius Barth, Leipzig (1995)MATHGoogle Scholar
- 4.van Dam E.R., Haemers W.H.: Developments on spectral characterizations of graphs. Discrete Math. 309, 576–586 (2009)MathSciNetMATHCrossRefGoogle Scholar
- 5.van Dam E.R., Haemers W.H.: Which graphs are determined by their spectrum?. Linear Algebra Appl. 373, 241–272 (2003)MathSciNetMATHCrossRefGoogle Scholar
- 6.van Dam E.R., Haemers W.H., Koolen J.H., Spence E.: Characterizing distance-regularity of graphs by the spectrum. J. Combin. Theory Ser. A 113, 1805–1820 (2006)MathSciNetMATHCrossRefGoogle Scholar
- 7.Haemers, W.H., Ramezani, F. Graphs cospectral to Kneser graphs. Contemp. Math. (to appear)Google Scholar
- 8.Heydemann M.C.: Spectral characterization of some graphs. J. Combin. Theory Ser. B. 25, 307–312 (1978)MathSciNetMATHCrossRefGoogle Scholar
- 9.Hoffman K.M., Kunze R.: Linear Algebra, 2nd edn. Englewood Cliffs, Prentice-Hall (1971)MATHGoogle Scholar
- 10.Huang T., Liu C.: Spectral characterization of some generalized odd graphs. Graphs Combin. 15, 195–209 (1999)MathSciNetMATHCrossRefGoogle Scholar
Copyright information
© Springer 2011