Connected non-complete signed graphs which have symmetric spectrum but are not sign-symmetric
Examples and Counterexamples · 2021
DOI: 10.1016/j.exco.2021.100007 ↗Kurz gefasst
Fachartikel in der Zeitschrift Examples and Counterexamples, 2021. Verfasst von Zoran Stanić. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 5 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Univerzitet u Beogradu, Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja.
Abstract (Originalsprache)
A signed graph G is called sign-symmetric if it is switching isomorphic to its negation − G , where − G is obtained by reversing the sign of every edge of G . The authors of Belardo et al. (2018) constructed a complete signed graph that is not sign-symmetric, but has a symmetric spectrum and posted the following problem: Are there connected non-complete signed graphs whose spectrum is symmetric but they are not sign-symmetric? In this paper we positively address this problem. Our examples include infinite families constructed on the basis of the Cartesian product and the corona product of signed graphs. We note that the same problem was first resolved in Ghorbani et al. (2020) by means of different constructions.
Förderung
- Univerzitet u Beogradu
- Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja
Zitieren
APA
Stanić, Z. (2021). Connected non-complete signed graphs which have symmetric spectrum but are not sign-symmetric. Examples and Counterexamples. https://doi.org/10.1016/j.exco.2021.100007
Vancouver
Stanić Z. Connected non-complete signed graphs which have symmetric spectrum but are not sign-symmetric. Examples and Counterexamples. 2021. doi:10.1016/j.exco.2021.100007
BibTeX
@article{Stani2021,
author = {Stanić, Zoran},
title = {Connected non-complete signed graphs which have symmetric spectrum but are not sign-symmetric},
journal = {Examples and Counterexamples},
year = {2021},
doi = {10.1016/j.exco.2021.100007}
}
EUVIMED