加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本