Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

2017

2017

Abstract New graph characteristic, the total H-irregularity strength of a graph, is introduced. Estimations on this parameter are… Expand

Is this relevant?

2013

2013

Abstract Let G = ( V , E ) be a graph, and let c : V → { 1 , 2 , … , k } be a not necessarily proper edge colouring. The weight… Expand

Is this relevant?

2012

2012

The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider… Expand

Is this relevant?

2009

2009

The strength of a graph G is the smallest integer s such that there exists a minimum sum coloring of G using integers {1,...,s… Expand

Is this relevant?

2007

2007

A graph G is called super edge-magic if there exists a one-to-one mapping f from V (G ) *** E (G ) onto {1, 2, 3, *** , |V (G… Expand

Is this relevant?

2006

2006

A graph G(V,E) is called super edge-magic if there exists a bijection f from [email protected]?E to {1,2,3,...,|V|+|E|} such that… Expand

Is this relevant?

2003

2003

The sum coloring problem asks to find a vertex coloring of a given graph G, using natural numbers, such that the total sum of the… Expand

Is this relevant?

1992

1992

Abstract In a 1983 paper, D. Gusfield introduced a function which is called (following W.H. Cunningham, 1985) the strength of a… Expand

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… Expand

Is this relevant?

1989

1989

A network is a simple graph to which each edge has been assigned a positive integer weight. A network is irregular if the sum of… Expand

Is this relevant?