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…

Papers overview

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

2018

A reverse magic labelling of a graph G(V, E) is a bijection f: V ∪ E → {1, 2, 3, ......, v + e} such that for all edges xy, f(xy…

2017

We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of…

2017

Given a graph G ( V , E ) a labeling ∂: V ∪ E →{1,2,..., k } is called an edge irregular total k -labeling if for every pair of…

2016

We consider restricted games on weighted communication graphs associated with minimum partitions. We replace in the classical…

2015

2014

An irregular assignment is a k -labeling of the edges : {1, 2, , } f E k → ... such that the vertex weights (label sums of edges…

2013

The injective chromatic number χi(G) [5] of a graph G is the minimum number of colors needed to color the vertices of G such that…

2008

We investigate the problem of computing the strength of a graph. We describe in this article the first polyhedral formulation for…

1999

1998

The strength of a graph has a strong interest to many respects. It was introduced by Cunningham [1] to study network resistance…