Document Type : Research Paper

Authors

• P. Jeyanthi ¹
• A. Sudha ²

¹ Research Centre, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, India.

² Department of Mathematics, Wavoo Wajeeha Women’s College of Arts and Science, Kayalpatnam -628 204,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 positive 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, P_n ⊙ K₁, P_n ⊙ K₂, C_n ⊙ K₂, L_n ⊙ K₁, CL_n ⊙ K₁, P₂ ⊙ C_n, P_n ⊙ K_m, C_n ⊙ K_m

Keywords

• irregularity strength
• total vertex irregularity strength
• vertex irregular total labeling
• corona product of path and cycle
• path and complete graph
• ladder and complete graph
• Graph