Connected non-complete signed graphs which have symmetric spectrum but are not sign-symmetric

A signed graph Ġis called sign-symmetric if it is switching isomorphic to its negation −Ġ, where −Ġis obtained by reversing the sign of every edge of Ġ. The authors of Belardo et al. (2018) constructed a complete signed graph that is not sign-symmetric, but has a symmetric spectrum and posted th...

Celý popis

Podrobná bibliografie

Hlavní autor:	Zoran Stanić
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Elsevier 2021-11-01
Edice:	Examples and Counterexamples
Témata:	Adjacency matrix Symmetric spectrum Sign-symmetric signed graph Cartesian product Corona product
On-line přístup:	http://www.sciencedirect.com/science/article/pii/S2666657X21000057
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!