Even Vertex Magic Total Labeling Of Some 2-Regular Graphs

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

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

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

Even 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 map f from V ∪ E onto the integers {1, 2, 3, ..., |V | + |E|} such that f(u) + Pf(uv) where the sum is over all vertices v adjacent to u, is a constant, independent of the choice of vertex u. Such a labeling is even if f(V (G)) = {2, 4, 6, ..., 2n}. In this paper, we present an even vertex magic total labeling of some 2 - regular graphs.

Keywords

Even vertex magic total labeling, Even vertex magic 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] CT.Nagaraj, C.Y.Ponnappan, G.Prabakaran, Even vertex magic total labeling of Trees, International Journal of pure and Applied Mathematics, Volume 115,No.9,(2017), 363 - 375.
[4] 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.

Citation :

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