International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 52 - Number 19 |
Year of Publication: 2012 |
Authors: Indra Rajasingh, Bharati Rajan, V. Annamma |
10.5120/8312-1947 |
Indra Rajasingh, Bharati Rajan, V. Annamma . On the Total Vertex Irregularity Strength of Cycle Related Graphs and H-Graphs. International Journal of Computer Applications. 52, 19 ( August 2012), 32-37. DOI=10.5120/8312-1947
Let G(V, E) be a simple graph. For a labeling 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).