The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts. To represent such signed directed graphs, we use a striking equivalence to -gain graphs to formulate a Hermitian adjacency matrix, whose entries are the unit Eisenstein integers , . Many well-known results, such as (gain) switching and eigenvalue interlacing, naturally carry over to this paradigm. We show that non-empty signed directed graphs whose spectra occur uniquely, up to isomorphism, do not exist, but we provide several infinite families whose spectra occur uniquely up to switching equivalence. Intermediate results include a classification of all signed digraphs with rank , and a deep discussion of signed digraphs with extremely few (1 or 2) non-negative (eq. non-positive) eigenvalues.
|Journal||Journal of Combinatorial Theory, Series A, Structures designs and application combinatorics|
|Publication status||Published - Apr 2022|
- complex unit gain graphs
- spectra of digraphs
- signed graphs