Total vertex irregularity strength of disjoint union of Helm graphs

@article{Ahmad2012TotalVI,
  title={Total vertex irregularity strength of disjoint union of Helm graphs},
  author={Ali Ahmad and Edy Tri Baskoro and Muhammad Imran},
  journal={Discussiones Mathematicae Graph Theory},
  year={2012},
  volume={32},
  pages={427-434}
}
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. We… CONTINUE READING