Author/Authors :
Jeyanthi, P Department of Mathematics - Govindammal Aditanar College for Women - Tiruchendur - Tamil Nadu, India , Sudha, A Department of Mathematics - Wavoo Wajeeha Women’s College of Arts and Science - Kayalpatnam - Tamil Nadu, India
Abstract :
A vertex irregular total k-labeling of a graph G with
vertex set V and edge set E is an assignment of posi-
tive integer labels {1, 2, ..., k} to both vertices and edges
so that the weights calculated at vertices are distinct.
The total vertex irregularity strength of G, denoted by
tvs(G)is the minimum value of the largest label k over
all such irregular assignment. In this paper, we study
the total vertex irregularity strength for n ≥ 3,m ≥
2, Pn ⊙ K1, Pn ⊙ K2,Cn ⊙ K2, Ln ⊙ K1,CLn ⊙ K1, P2 ⊙
Cn, Pn ⊙ Km,Cn ⊙ Km
Keywords :
irregularity strength , total vertex irregularity strength , vertex irregular total labeling , corona product of path and cycle , path and complete graph , ladder and com- plete graph. graph
