On the Total Vertex Irregularity Strength of Cycle Related Graphs and H-Graphs
Indra Rajasingh, Bharati Rajan, V. Annamma · International Journal of Computer Applications · 2012
Let G(V, E) be a simple graph.For a labeling : {1,2,3,..., },the weight of a vertex x is defined as ()where N(x) is the set of neighbours of x. f is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y (). The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G and is denoted by tvs(G).In this paper we find the total vertex irregularity strength of cycle related graphs H(n), DHF(n), F(n,2) and obtain a bound for the total vertex irregularity strength of H graphs H(k).