Abstract
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f from V(G)∪E(G) to the consecutive integers 1, 2, ..., p+q with the property that for every u∈V(G) , f( u)+ ∑f(uv)=K for some constant k. Such a labeling is E-super if f :E(G)→{1, 2,..., q}. A graph G is called E-super vertex magic if it admits an E-super vertex magic labeling. In this paper, we solve two open problems given by Marimuthu, Suganya, Kalaivani and Balakrishnan (Marimuthu et al., 2015).
Recommended Citation
Marimuthu, G.; Raja Durga, M. S.; and Devi, G. D.
(2015).
Solution to Some Open Problems on E-super Vertex Magic Total Labeling of Graphs,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 10,
Iss.
2, Article 33.
Available at:
https://digitalcommons.pvamu.edu/aam/vol10/iss2/33