Skew-adjacency matrices of graphs
By Michael S. Cavers, Sebastian M. Cioaba, Shaun M. Fallat, David A. Gregory, Willem H. Haemers, S. Kirkland, J. McDonald, Michael J. Tsatsomeros. 2012
84 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/c9ddb7d791021f06c03bc7f2f3f63011b1664830
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Geometry and Topology
Citations in the corpus
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs (2015, unknown): “The proof is similar to the proof of Theorem 4.2 in [7].”
- A new kind of Hermitian matrices for digraphs (2019, methodology): “om uto v, and 1 if there is an arc from vto u(and 0 otherwise). This choice is quite natural but it only works for oriented graphs (i.e. when we have no digons). We refer to a survey by Cavers et al. [3]. A Hermitian adjacency matrix for digraphs and mixed graphs was introduced recently by Guo and M”