@techreport{4df47845b9e64bd5b3dbd0641132d8a8,
title = "On sign-symmetric signed graphs",
abstract = "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{\u a}, Koolen, and Wang (2018).",
author = "Ebrahim Ghorbani and Haemers, \{W. H.\} and Maimani, \{Hamid Reza\} and \{Parsaei Majd\}, Leila",
year = "2020",
month = mar,
language = "English",
series = "arXiv",
publisher = "Cornell University Library",
type = "WorkingPaper",
institution = "Cornell University Library",
}