In the branch of mathematics called graph theory, the strength of an undirected graph corresponds to the minimum ratio edges removed/componentsâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Michel Grabisch, Alexandre Skoda
- Annals OR
- 2012

The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We considerâ€¦Â (More)

Is this relevant?

2011

2011

We study cooperative games associated with a communication structure which takes into account a level of communication betweenâ€¦Â (More)

Is this relevant?

2010

2010

- Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender
- Discrete Applied Mathematics
- 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)

Is this relevant?

2008

2008

- JÃ©rÃ´me Galtier
- 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

- Ewa Kubicka
- Int. J. Math. Mathematical Sciences
- 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)

Is this relevant?

2003

2003

- Mohammad R. Salavatipour
- Discrete Applied Mathematics
- 2003

On Sum Coloring of Graphs Mohammadreza Salavatipour Master of Science Graduate Department of Computer Science University ofâ€¦Â (More)

Is this relevant?

2003

2003

- Vikhram Vilasur Swaminathan, P. Jeyanthi
- Discrete Mathematics
- 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)

Is this relevant?

2000

2000

- Olivier Togni
- Discrete Mathematics
- 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)

Is this relevant?

1999

1999

- AndrÃ© E. KÃ©zdy, Chi Wang
- Discrete Mathematics
- 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

- Dan Gusfield
- SIAM J. Comput.
- 1991

The strength of a graph is a measure of its vulnerability, strictly generalizing the edge connectivity of a weighted graphâ€¦Â (More)

Is this relevant?