Abstract
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection from the union of the vertex set and the edge set to the consecutive integers 1, 2, 3, . . . , p + q 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. Such a labelling is E-super, if the labels of the edge set is the set {1, 2, 3, . . . , q }. A graph G is called E-super vertex magic, if it admits an E-super vertex magic labelling. In this paper, we establish an E-super vertex magic labelling of some classes of graphs and provide some open problems related to it.
Recommended Citation
Marimuthu, G.; Suganya, B.; Kalaivani, S.; and Balakrishnan, M.
(2015).
E-super vertex magic labelling of graphs and some open problems,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 10,
Iss.
1, Article 31.
Available at:
https://digitalcommons.pvamu.edu/aam/vol10/iss1/31