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.

2019

Communication for omniscience (CO) refers to the problem where the users in a finite set $V$ observe a discrete multiple random…

2016

2015

If positive weights are assigned to the edges of a graph G, then degree of a vertex is the sum of the weights of edges that are…

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…

2013

Let G (V, E) be a graph with p vertices and q edges. A bijection f : V E  {1,2,…., p+q} is called a super magic labeling of a…

2013

In this paper we introduced the concept of complementary super edge magic labeling and Complementary Super Edge Magic strength of…

1998

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