On sign-symmetric signed graphs

Ebrahim Ghorbani, W. H. Haemers, Hamid Reza Maimani, Leila Parsaei Majd

Research output: Working paperOther research output

138 Downloads (Pure)


A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed graphs have a symmetric spectrum but not the other way around. We present constructions of signed graphs with symmetric spectra which are not sign-symmetric. This, in particular answers a problem posed by Belardo, Cioabă, Koolen, and Wang (2018).
Original languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Number of pages12
Publication statusPublished - Mar 2020

Publication series



Dive into the research topics of 'On sign-symmetric signed graphs'. Together they form a unique fingerprint.

Cite this