Odd Vertex Magic Total Labeling of Some 2-Regular Graphs

CT. NAGARAJ; C.Y. PONNAPPAN; G. PRABAKARAN

doi:https://doi.org/10.14445/22315373/IJMTT-V54P504

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 54 | Number 1 | Year 2018 | Article Id. IJMTT-V54P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V54P504

Odd Vertex Magic Total Labeling of Some 2-Regular Graphs

CT. NAGARAJ,C.Y. PONNAPPAN, G. PRABAKARAN

Abstract

A vertex magic total labeling of a graph G(V, E) is defined as one - to - one mapping from the set of integers {1, 2, 3, ..., |V | + |E|} to V ∪ E with the property that the sum of the label of a vertex and the labels of all edges adjacent to this vertex is the same constant for all vertices of the graph. Such a labeling is called odd if f(V ) = {1, 3, 5, ..., 2n − 1}. In this paper, we present an odd vertex magic total labeling of of some 2 - regular graphs.

Keywords

Magic, Labeling, Odd vertex magic total graph.

References

[1] J.A. Gallian, A dynamic survey of graph labeling electronic, J.Combinatorics 5(2002) # D56.
[2] J.A. MacDougall, M.Miller, Slamin, W.D.Wallis, Vertex magic total labeling of graphs, Util.Math 61 (2002) 3-21.
[3] J.A.MacDougall, M.Miller,K.A.Sugeng,Super vertex magic total labelling of graphs, in: Proc.of the 15th Australian Workshop on Combinatorial Algorithms,2004,pp.222-229.
[4] CT.Nagaraj, C.Y.Ponnappan, G.Prabakaran, Odd vertex magic total labeling of some graphs, Communicated
[5] CT.Nagaraj, C.Y.Ponnappan, G.Prabakaran, Odd vertex magic total labeling of Trees, International Journal of Mathematics Trends and Technology, Volume 52,No.6,December(2017).
[6] W.D.Wallis, magic Graphs, Birkhauser, Barel, 2001.

Citation :

CT. NAGARAJ,C.Y. PONNAPPAN, G. PRABAKARAN, "Odd Vertex Magic Total Labeling of Some 2-Regular Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 54, no. 1, pp. 34-41, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V54P504