Matrices in the Theory of Signed Simple Graphs
By Thomas Zaslavsky. 2013
197 citations recorded by the source corpus.
I discuss the work of many authors on various matrices used to study signed graphs, concentrating on adjacency and incidence matrices and the closely related topics of Kirchhoff (`Laplacian') matrices, line graphs, and very strong regularity.
Subfields: Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/1cef0298ae3db0ba4ea90b9388bbe4b84c29b3a7
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
- On the adjacency matrix of a complex unit gain graph (2018, background): “For some interesting spectral properties of gain graphs, we refer to [14, 15, 16, 21].”
- An oriented hypergraphic approach to algebraic graph theory (2012, methodology): “The following definition was introduced by Zaslavsky [7].”