Vertex magic total labeling of middle and total graph of cycle

A vertex magic total labeling is a bijection from the union of the vertex set and edge set to the consecutive integers 1,2,3,....,v+e with the property that for every u in the vertex set, the sum of the label of u and the label of the edges incident with u is equal to k, for some constant k. In this paper, we establish the vertex magic labeling of some classes of graphs and provide some open problems related to it.

___

  • Bollobas, Bela, Graph theory: An introductory course, Springer-Verlag, New York, NY, 1979.
  • Cunningham, Daisy, Vertex-Magic, Electronic Journal of Undergraduate Mathematics, Furman University, (2004), Volume 9, 1-20.
  • Finkbeiner, D. and Lindstrom, W. A primer of Discrete Mathematics, W.H.Freeman and Co., New York, NY, 1987.
  • Locke, Stephen C., Graph Theory . Online Posting. http://math.fau.edu/lockemgraphthe.htm.
  • Wallis, W.D., Magic Graphs, Birkhauser, New York, NY, 2001.