%0 Journal Article
%T Total vertex irregularity strength of corona product of some graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Jeyanthi, P.
%A Sudha, A.
%D 2016
%\ 12/25/2016
%V 48
%N 1
%P 127-140
%! Total vertex irregularity strength of corona product of some graphs
%K irregularity strength
%K total vertex irregularity strength
%K vertex irregular total labeling
%K corona product of path and cycle
%K path and complete graph
%K ladder and complete graph
%K Graph
%R 10.22059/jac.2016.7948
%X 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
%U https://jac.ut.ac.ir/article_7948_75d3525b3126762d9d4dfccb440cd4e7.pdf