Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs
Hong Yang, Muhammad Aamer Rashid, Sarfraz Ahmad, Muhammad Kamran Siddiqui, Muhammad Farhan Hanif · Journal of Discrete Mathematical Sciences and Cryptography · 2019
A simple graph G(V, E) admits a H-covering, if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is said to be H-magic, if there exists a bijection ψ: V(G) ∪ E(G) → {1, 2, 3, … ,|V(G)|+|E(G)|} such that for every subgraph H¢ of G isomorphic to is constant. Moreover G is said to be H-super magic, if ψ (V(G)) = {1, 2, 3, … ,|V(G)|}. In this paper, we study the cycle-super magic labeling of a pumpkin graph and two classes of planar maps containing 8-sided and 4-sided faces or 6-sided and 4-sided faces, respectively.