Cospectral Graphs and Regular Orthogonal Matrices of Level 2
AbstractAbstract: For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into a graph Γ' with adjacency matrix A', defined by A' = QtAQ, where Q is a regular orthogonal matrix of level 2 (that is, QtQ = I, Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an operation exists, and Γ is nonisomorphic with Γ', then we say that Γ' is semi-isomorphic with Γ. Semiisomorphic graphs are R-cospectral, which means that they are cospectral and so are their complements. Wang and Xu [‘On the asymptotic behavior of graphs determined by their generalized spectra’, Discrete Math. 310 (2010)] expect that almost all pairs of R-cospectral graphs are semi-isomorphic. Regular orthogonal matrices of level 2 have been classified. By use of this classification we work out the requirements for this switching operation to work in case Q has one nontrivial indecomposable block of size 4, 6, 7 or 8. Size 4 corresponds to Godsil-McKay switching. The other cases provide new methods for constructions of R-cospectral graphs. For graphs with eight vertices all these constructions are carried out. As a result we find that, out of the 1166 graphs on eight vertices which are R-cospectral to another graph, only 44 are not semi-isomorphic to another graph.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2012-042.
Date of creation: 2012
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
cospectral graphs; orthogonal matrices; switching;
Find related papers by JEL classification:
- C0 - Mathematical and Quantitative Methods - - General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2012-06-13 (All new papers)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Dam, E.R. van & Haemers, W.H. & Koolen, J.H., 2006.
"Cospectral Graphs and the Generalized Adjacency Matrix,"
2006-31, Tilburg University, Center for Economic Research.
- Dam, E.R. van & Haemers, W.H. & Koolen, J.H., 2007. "Cospectral graphs and the generalized adjacency matrix," Open Access publications from Tilburg University urn:nbn:nl:ui:12-211632, Tilburg University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.