On Super Magic Algorithm for Union of Comb and Star Graph

In [7], Enomoto et al. identified the concept of super edge magic total labeling of graphs by getting motivation from the idea of edge-magic labeling of graphs that was brought into light by Kotzig and Rosa [20]. An edge magic total labeling of a graph G is a one to one map φ from V (G) ∪E(G) onto the set {1, 2, …, |V (G)| +|E(G)|} with the property that, there is an integer constant α such that φ(u) +φ(uv) +φ(v) = α for any (u, v) ∈ E(G). Moreover if φ(V (G)) = {1, 2, …, |V (G)|}, then edge magic total labeling is called super edge magic total labeling. In this paper, we study the super edge magic total labeling of generalized comb graph.