On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
From MaRDI portal
Publication:6204328
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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 3465382 (Why is no real title available?)
- scientific article; zbMATH DE number 691513 (Why is no real title available?)
- A new kind of Hermitian matrices for digraphs
- Asymptotic behavior of the transition probability of a random walk on an infinite graph
- Fluxes, Laplacians, and Kasteleyn's theorem
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- On sign-symmetric signed graphs
- On the adjacency matrix of a complex unit gain graph
- Periodicity of quantum walks defined by mixed paths and mixed cycles
- Quantum walks defined by digraphs and generalized Hermitian adjacency matrices
- Spectral and asymptotic properties of Grover walks on crystal lattices
- Spectral properties of complex unit gain graphs
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Weak Bloch property for discrete magnetic Schrödinger operators
This page was built for publication: On symmetric spectra of Hermitian adjacency matrices for non-bipartite mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204328)