On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
Abstract
We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for θ-Hermitian adjacency matrices defined by an angle θ ∈ (0, π]. We show that this equivalence holds when, for example, an angle θ is an algebraic number, while it breaks down for any angle θ ∈ Qπ. Furthermore, we construct a family of non-bipartite mixed graphs having the symmetric spectra for given θ ∈ Qπ.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.