Some non-sign-symmetric signed graphs with symmetric spectrum

arXiv1909.06821MaRDI QIDQ6325333FDOQ6325333

Publication date: 15 September 2019

Abstract: We construct infinitely many signed graphs having symmetric spectrum, by using the NEPS and rooted product of signed graphs. We also present a method for constructing large cospectral signed graphs. Although the obtained family contains only a minority of signed graphs, it strengthen the belief that the signed graphs with symmetric spectrum are deeper than bipartite graphs, i.e the unsigned graphs with symmetric spectrum.

This page was built for publication: Some non-sign-symmetric signed graphs with symmetric spectrum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325333)