## Abstract

Let G be a graph with vertex set V = V(G) and edge set E = E(G), and let n = \V(G)\ and e = \E(G)\. A vertex-magic total labeling (VMTL) of a graph is defined as a one-to-one mapping taking the vertices and edges onto the set of integers {1,2,..., n + e}, with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex. In this paper, we present the vertex magic total labeling of disjoint union of t generalized Petersen graphs U_{j=1} ^{t}P(n_{j},m_{j}), and disjoint union of t special circulant graphs U_{j=1}^{t}C_{n}(1,m_{j}).

Original language | English |
---|---|

Pages (from-to) | 201-207 |

Number of pages | 7 |

Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |

Volume | 71 |

Publication status | Published - Nov 2009 |

## Keywords

- Circulant graph
- Generalized petersen graph
- Regular graph
- Vertex magic total labeling