ON SOME DIVISOR CORDIAL LABELINGS IN H - GRAPH

Abstract In 2011 [11], Varatharajan.et.al., introduced the concept of divisor cordial labeling. Let G=(δ(G), β(G)) be a graph with p vertices and q edges. A bijective function S : d (G) ® {1,2,3,….,p} is said to be a divisor cordial labeling, if an induced function S*(bc) = {1 (s(b)│s(c)) or(s(c)│s(b)) , ∀ bc ∈ β(G) 0 otherwise satisfies the condition |βs* (0)-βs* (1) |≤1. A graph which admits a divisor cordial labeling is called a divisor cordial graph. In this paper we investigate the existence of some divisor cordial labelings of the H graph.