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ă, Koolen, and Wang (2018).
| Original language | English |
|---|---|
| Pages (from-to) | 83-93 |
| Journal | Ars Mathematica Contemporanea |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Mar 2020 |
Keywords
- signed graph
- spectrum
Fingerprint
Dive into the research topics of 'On sign-symmetric signed graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver