Vertex-magic total labeling of family of graphs

A vertex- magic total labelling of a (p,q)-graph G with p-vertices and q-edges is defined as one-to-one correspondence by taking vertices and edges onto the integers with the property that the sum of labels on a vertex and the edges incident on it is a constant, independent for all the vertices of graph. In this paper, the properties of these labelings are studies. It explains how to construct labelings for various families of graphs which includes paths, cycles, complete graph of odd order, complete bipartite graphs, products of cycles, generalized Petersen graph P (n, m) for all .