Signed Graphs

By K. Stefaniak, Mikolaj Morzy. Encyclopedia of Social Network Analysis and Mining, 2014

457 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Consensus Problems on Networks With Antagonistic Interactions (2013, background): “Gauge equivalence (or switching equivalence in the theory of signed graphs [48], or signature similarity as it is called in the field of signed pattern matrices [10]) is a finite-cardinality subclass of the similarity equivalence of matrices, which leaves the modulus of the entries of a matrix uncha”
On the consensus and bipartite consensus in high-order multi-agent dynamical systems with antagonistic interactions (2014, background): “In graph theoretic terms, antagonistic interactions can be taken into account by replacing the standard communication graph, characterized by nonnegative weights, with a signed graph [13, 33] displaying both positive and negative weights.”