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 to...
