In this work labeling of planar graphs is taken up which involves labeling the p vertices, the q edges and the f internal faces such that the weights of the faces form an arithmetic progression with common difference d. If d = 0, then the planar graph is said to have an Inner Magic labeling; and if d = 0, then it is Inner Antimagic labeling. Some new kinds of graphs have been developed which ha...

A graph G is said to have totally magic cordial(TMC) labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0)− nf (1)| ≤ 1, where nf (i)(i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we investigate some new families of graphs that admit totally magic cordial labeli...

A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H−magic if there exists a bijection f : V (G) [ E(G) ! {1, 2, 3, · · · , |V (G) [ E(G)|} such that for every subgraph H0 P of G isomorphic to H. G is said to be H − supermagic if f(V (G)) = {1, 2, 3, · · · , |V (G)|}. In thi...