Application of Reverse Vertex Magic Labeling of a Graph
Masthan Raju. U1, Sharief Basha.S2

1Sharief Basha.S, Department of Mathematics, School of Advanced Sciences,Vellore Institute of Technology, Vellore , Tamilnadu, India.
2Masthan Raju. U, Department of Mathematics, School of Advanced Sciences,Vellore Institute of Technology, Vellore , Tamilnadu, India.
Manuscript received on 29 August 2019. | Revised Manuscript received on 22 September 2019. | Manuscript published on 30 September 2019. | PP: 12-14 | Volume-8 Issue-11, September 2019. | Retrieval Number: J98820881019/2019©BEIESP | DOI: 10.35940/ijitee.J9882.0981119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Graph labeling is a currently emerging area in the research of graph theory. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. If the labels of edges are distinct positive integers and for each vertex the sum of the labels of all edges incident with is the same for every vertex in the given graph, then the labeling of the graph is called magic labeling. There are several types of magic labeling defined on graphs. In this paper we consider vertex magic labeling and group magic labeling of graphs as an application of magic labeling. We solve a problem of finding number of computers/workstations to be allocated to each department in a company under certain conditions.
Keywords: vertex magic labeling, group magic labeling.
Scope of the Article: