On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
arXiv:2302.03252
Abstract
We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for -Hermitian adjacency matrices defined by an angle . We show that this equivalence holds when, for example, an angle is an algebraic number, while it breaks down for any angle . Furthermore, we construct a family of non-bipartite mixed graphs having the symmetric spectra for given .
25 pages, 12 figures, 3 tables