Application of reverse vertex magic labeling of a graph

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Masthan Raju, U., & Sharief Basha, S. (2019). Application of reverse vertex magic labeling of a graph. International Journal of Innovative Technology and Exploring Engineering, 8(11), 12–14. https://doi.org/10.35940/ijitee.J9882.0981119

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free