Abstract
ABSTRACT A well-known fact in Spectral Graph Theory is the existence of pairs of cospectral (or isospectral) nonisomorphic graphs, known as PINGS. The work of A.J. Schwenk (in 1973) and of C. Godsil and B. McKay (in 1982) shed some light on the explanation of the presence of cospectral graphs, and they gave routines to construct PINGS. Here, we consider the Godsil–McKay-type routines developed for graphs, whose adjacency matrices are -matrices, to the level of signed graphs, whose adjacency matrices allow the presence of s. We show that, with suitable adaption, such routines can be successfully ported to signed graphs, and we can build pairs of cospectral switching nonisomorphic signed graphs.
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.
