• Elizabeth Augustine
• Prof. Dr. Shiny Jose

Graphs are discrete structures consisting of vertices and edges which connect the vertices. Graph theory has now branched off into various directions - domination in graph, hypergraph, topological graph theory, algebraic graph theory, labeling of graphs to name a few. Among these, graph labeling has various applications in different fields. Different types of graph labelling techniques are available in literature. A graph labeling is called an anti- magic labeling if the edges of the graph can be labeled with 1, 2, . . . , E (where E is the number of edges in the graph) without repetition such that the sums of the labels of the edges incident to each vertex(vertex sum) are distinct. In this paper we found an application of anti- magic labeling in Location identification problems. Location identification problems refer to the process of evaluating and assessing the suitability of a particular location for a specific purpose. An application in locating warehouse is illustrated.

Graph Labeling, Magic Labeling, Anti- Magic Labeling, Location Problems.

"Location Identification Using Anti-magic Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.12, Issue 7, page no.h109-h112, July-2025, Available :http://www.jetir.org/papers/JETIR2507715.pdf

"Location Identification Using Anti-magic Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.12, Issue 7, page no. pph109-h112, July-2025, Available at : http://www.jetir.org/papers/JETIR2507715.pdf