Signed graph

Known as: Signed graphs 
In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign. Two fundamental questions… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Due to the fact much of today's data can be represented as graphs, there has been a demand for generalizing neural network models… (More)
  • figure 1
  • figure 2
  • table II
Is this relevant?
2018
2018
Due to the fact much of today’s data can be represented as graphs, there has been a demand for generalizing neural network models… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • table II
Is this relevant?
2017
2017
ABSTRACT In a signed graph, each link is labeled with either a positive or a negative sign. This is particularly appropriate to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
Privacy protection is one of the most challenging problems of social networks. Simple removal of the labels is unable to protect… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2016
2016
In 1982, Zaslavsky introduced the concept of a proper vertex colouring of a signed graph G as a mapping φ : V (G) → Z such that… (More)
Is this relevant?
2012
2012
  • P. Siva Kota Reddy, B. Prashanth
  • 2012
In this paper, we define the common minimal dominating signed graph of a given signed graph and offer a structural… (More)
Is this relevant?
2011
2011
Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
  • P. Siva Kota Reddy, S. Vijay
  • 2010
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ) (S = (G, μ)) where G = (V, E) is a… (More)
Is this relevant?
2007
2007
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1989
1989
This paper introduces a generalization of the Tutte polynomial [14] that is defined for signed graphs. A signed graph is a graph… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?