A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

For a simple graph G, a vertex labeling ϕ: V (G)→{1, 2,…, k} is called k-labeling. The weight
of an edge xy in G, denoted by w ϕ (xy), is the sum of the labels of end vertices x and y, ie w …

An edge irregular k-labeling of a graph G is a labeling of the vertices of G with labels from
the set {1, 2,..., k} in such a way that for any two different edges xy and xy their weights w (xy) …

Abstract Let G=(V, E) be a graph. A total labeling f: V≼ E→{1, 2,…, k} is called totally
irregular total k-labeling of G if every two distinct vertices x and y in V satisfies wt (x)≠ wt (y) …

A totally irregular total k-labeling λ: V∪ E→{1, 2,···, k} of a graph G is a total labeling such
that G has a total edge irregular labeling and a total vertex irregular labeling at the same …

A Survey of Irregularity Strength Page 1 A Survey of Irregularity Strength Martin Baca1,2 Department
of Appl. Mathematics and Informatics Technical University Košice, Slovak Republic Stanislav …

As a standard notation, assume that G= G (V, E) is a finite, simple and undirected graph with
p vertices and q edges. A labeling of a graph is any map** that sends some set of graph …

We deal with the totally irregular total labeling which is required to be at the same time
vertex irregular total and also edge irregular total. The minimum k for which a graph G has a …

On The Total Irregularity Strength of Regular Graphs Page 1 J. Math. Fund. Sci., Vol. 47, No. 3,
2015, 281-295 281 Received March 14th, 2015, 1st Revision August 31st, 2015, Accepted for …

Abstract Let G=(V, E) be a simple and undirected graph with a vertex set V and an edge set
E. A totally irregular total k-labeling f: V∪ E→{1, 2,..., k} is a labeling of vertices and edges of …