The generalized prism P nm can be defined as the Cartesian product C n□ P m of a cycle
on n vertices with a path on m vertices. An edge irregular total k-labeling of a graph G is …

An edge irregular total k-labeling φ: V (G)∪ E (G)→{1, 2,…, k} of a graph G=(V, E) is a
labeling of vertices and edges of G in such a way that for any different edges xy and x′ y …

An edge irregular total k-labeling of a graph G=(V, E) is a labeling φ: V∪ E→{1, 2,..., k} such
that the total edge-weights wt (xy)= φ (x)+ φ (xy)+ φ (y) are different for all pairs of distinct …

Abstract Let G=(V, E) be a simple, connected and undirected graph with non empty vertex
set V and edge set E. An edge irregular total k-labeling f: V (G) ∪ E (G) → {1, 2, ..., k\} f: V …

An edge irregular total k-labeling of a graph G is a labeling of the vertices and edges with
labels 1, 2,..., k such that the weights of any two different edges are distinct, where the weight …

For a graph G, an edge irregular total r-labelling π: V∪ E→{1, 2, 3,…, r} is a labelling for
edges and vertices of a graph G in such a way that the weights of any two different edges …

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 …

In this paper, we study the total edge irregularity strength of some well known graphs. An
edge irregular total k-labeling ϕ: V∪ E→{1, 2,..., k} of a graph G=(V, E) is a labeling of …

Full article: On irregularity strength of diamond network Skip to Main Content Taylor and
Francis Online homepage Taylor and Francis Online homepage Log in | Register Cart 1.Home …

Abstract Let G (V, E) be a graph. A function f from $ V (G)\cup E (G) $ to the set {1, 2,..., k} is
called an edge irregular total k-labeling of G if the weights of any two different edges ux and …