Hermitian Adjacency Matrix of Digraphs and Mixed Graphs

@article{Guo2017HermitianAM,
  title={Hermitian Adjacency Matrix of Digraphs and Mixed Graphs},
  author={Krystal Guo and B. Mohar},
  journal={Journal of Graph Theory},
  year={2017},
  volume={85},
  pages={217-248}
}
  • Krystal Guo, B. Mohar
  • Published 2017
  • Mathematics, Computer Science
  • Journal of Graph Theory
  • The article gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from x to y is equal to the complex unity i (and its symmetric entry is −i) if the reverse arc yx is not present. We also allow arcs in both directions and unoriented edges, in which case we use 1 as the entry. This allows to use the definition also for mixed graphs. This matrix has many nice properties… CONTINUE READING
    Transient Cystoid Macular Oedema in Multiple Choroidal Naevi
    Comparing semantic space models using child -directed speech
    14
    Trichotillomania: A current review.
    138
    A GATE-TO-GATE LIFE-CYCLE INVENTORY OF SOLID HARDWOOD FLOORING IN THE EASTERN US
    19

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 25 REFERENCES
    Population regulation in mammals : an evolutionary perspective
    214
    A Streakline Representation of Flow in Crowded Scenes
    190
    A prospective randomized study on the use of a synthetic porous ceramic as a bone graft substitute in instrumented Posterior spondylodesis
    • 1994
    Hermitian-adjacency matrices and Hermitian energies of mixed graphs
    53
    Spectra Of Graphs
    1158
    Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom
    • 1964
    Simple eigenvalues of graphs and digraphs
    7