Total vertex irregularity strength for trees with many vertices of degree two

Abstract

For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total k-labeling of G if for every two different vertices x and y, wt(x) ≠ wt(y), where wt(x) = φ(x)+ Σ􏰄_xy∈E(G) φ(xy). The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. In this paper, we provide three possible values of total vertex irregularity strength for trees with many vertices of degree two. For each of the possible values, sufficient conditions for trees with corresponding total vertex irregularity strength are presented.