Strength of a graph

Known as: Strength of a graph (graph theory) 
In the branch of mathematics called graph theory, the strength of an undirected graph corresponds to the minimum ratio edges removed/components… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2016
01219912016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2011
2011
We study cooperative games associated with a communication structure which takes into account a level of communication between… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the… (More)
  • figure 1
Is this relevant?
2008
2008
We investigate the problem of computing the strength of a graph. We describe in this article the first polyhedral formulation for… (More)
Is this relevant?
2004
2004
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength of a… (More)
  • figure 1.1
  • figure 3.1
  • figure 7.1
Is this relevant?
2003
2003
On Sum Coloring of Graphs Mohammadreza Salavatipour Master of Science Graduate Department of Computer Science University of… (More)
Is this relevant?
2003
2003
A graph G(V,E) is called super edge-magic if there exists a bijection f from V ∪ E to {1, 2, 3, . . . , |V | + |E|} such that f… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
The irregularity strength of a graph G is the smallest possible value of k or which we can assign positive integers not greater… (More)
  • figure 1
  • figure 2
Is this relevant?
1999
1999
A graph is partially 2-edge-colored if edges of G are colored by two colors, possibly with some edges uncolored. A walk is… (More)
Is this relevant?
1991
1991
The strength of a graph is a measure of its vulnerability, strictly generalizing the edge connectivity of a weighted graph… (More)
  • figure 1
Is this relevant?