@article {
author = {Jeyanthi, P. and Sudha, A.},
title = {Total vertex irregularity strength of corona product of some graphs},
journal = {Journal of Algorithms and Computation},
volume = {48},
number = {1},
pages = {127-140},
year = {2016},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2016.7948},
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 = {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},
url = {https://jac.ut.ac.ir/article_7948.html},
eprint = {https://jac.ut.ac.ir/article_7948_75d3525b3126762d9d4dfccb440cd4e7.pdf}
}