TY - JOUR

T1 - On Total Edge Irregularity Strength of Generalized Web Graphs and Related Graphs

AU - Indriati, Diari

AU - Widodo,

AU - Wijayanti, Indah E.

AU - Ariyanti, Kiki

AU - Bača, Martin

PY - 2015/6/15

Y1 - 2015/6/15

N2 - 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} is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights f(x) + f(xy) + f(y) and f(x′) + f(x′y′) + f(y′) are distinct. A total edge irregularity strength of graph G, denoted by tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. In this paper, we determine the exact value of the total edge irregularity strength of the generalized web graph W(n, m) and two families of related graphs.

AB - 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} is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights f(x) + f(xy) + f(y) and f(x′) + f(x′y′) + f(y′) are distinct. A total edge irregularity strength of graph G, denoted by tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. In this paper, we determine the exact value of the total edge irregularity strength of the generalized web graph W(n, m) and two families of related graphs.

KW - Generalized web

KW - Irregular total k-labeling

KW - Total edge irregularity strength

UR - http://www.scopus.com/inward/record.url?scp=84930867797&partnerID=8YFLogxK

U2 - 10.1007/s11786-015-0221-5

DO - 10.1007/s11786-015-0221-5

M3 - Article

AN - SCOPUS:84930867797

VL - 9

SP - 161

EP - 167

JO - Mathematics in Computer Science

JF - Mathematics in Computer Science

SN - 1661-8270

IS - 2

ER -