Abstract
Let G = (V, E) be a graph. A total labeling phi: V boolean OR E -> {1, 2, . . . , k} is called totally irregular total k-labeling of G if every two distinct vertices x and y in V(G) satisfy wt(x) not equal wt(y), and every two distinct edges x(1)x(2) and y(1)y(2) in E(G) satisfy wt(x(1)x(2)) not equal wt(y(1)y(2)), where
wt(x) = phi(x) + Sigma(xz is an element of E(G)) phi(xz)
and
wt(x(1)x(2)) = phi(x(1)) + phi(x(1)x(2)) + phi(x(2))
The minimum k for which a graph G has a totally irregular total k-labeling is called the total irregularity strength of G, denoted by ts(G). In this paper, we determined the total irregularity strength of generalized Petersen graph.