A note on vertex irregular total labeling of trees
A note on vertex irregular total labeling of trees
The total vertex irregularity strength of a graph <em>G=</em>(<em>V,E</em>) is the minimum integer <em>k</em> so that there is a mapping from <em>V ∪ E</em> to the set {<em>1,2,...,k</em>} so that the vertex-weights (i.e., the sum of labels of a vertex together with the edges incident to it) are all distinct. …