Total Vertex Irregularity Strength of the Disjoint Union of Sun Graphs
Slamin Slamin, Dafik Dafik, Wyse Winnona · International Journal of Combinatorics · 2011
A vertex irregular total -labeling of a graph with vertex set and edge set is an assignment of positive integer labels to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of , denoted by is the minimum value of the largest label over all such irregular assignment. In this paper, we consider the total vertex irregularity strengths of disjoint union of isomorphic sun graphs, , disjoint union of consecutive nonisomorphic sun graphs, , and disjoint union of any two nonisomorphic sun graphs .