Abstract
Spectral graph theory mainly concerns using graph spectra to obtain structural information about the given graphs. The study of cospectral graphs is important since it reveals which graph properties cannot be deduced from the spectra of the graphs. The construction of cospectral graphs has been investigated extensively and there are many methods known in the literature, such as Seidel switching, Schwenk's construction, Sunada's method, among which, the so called GM-switching method, proposed by Godsil and McKay in 1982, is proved to be a simple and powerful one. In this paper, we give an analogue of the GM-switching method for constructing cospectral graphs, which improves a previous result of the first and the third authors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
