Total vertex irregularity strength of corona product of some graphs

Document Type : Research Paper

Authors

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

2 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, Pn ⊙ K1, Pn ⊙ K2, Cn ⊙ K2, Ln ⊙ K1, CLn ⊙ K1, P2 ⊙ Cn, Pn ⊙ Km, Cn ⊙ Km

Keywords

Journal of Algorithms and Computation
Volume 48, Issue 1 - Serial Number 1
December 2016
Pages 127-140

Files

Share

How to cite

Statistics