Abstrait

SOME GRAPHS WITH n- EDGE MAGIC LABELING

Neelam Kumari, Seema Mehra

In this paper a new labeling known as n-edge magic labeling is introduced. Let G (V, E) be a graph, where V and E represents the set of vertices and edges respectively .We denote the graph G by G (p, q) , having p vertices and q edges. Graph, graph labeling, magic labeling, edge magic labeling, vertex magic labeling, 0-edgemagic labeling and 1-edge magic labeling have been discussed. It is proved that some graphs such as Pn, Cn (n being odd +ve integer) and many other graphs have n-edge magic labeling. In this paper the problem of graphs having n- edge magic labeling is studied.