Open AccessApplication of Reverse Vertex Magic Labeling of a Graph
Author(s) -
Sharief Basha.S*,
Masthan Raju. U
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.j9882.0981119
Subject(s) - edge graceful labeling , graph labeling , combinatorics , magic (telescope) , vertex (graph theory) , graph , mathematics , computer science , discrete mathematics , graph power , line graph , physics , quantum mechanics
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.