Solution to Some Open Problems on E-super Vertex Magic Total Labeling of Graphs
2015
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f from G E G V to the consecutive integers 1, 2, ..., p+q with the property that for every G V u , k uv f u f u N v for some constant k. Such a labeling is E-super if q G E f , , 2 , 1 : . 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).
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
8
References
0
Citations
NaN
KQI