In 2011 [11], Varatharajan.et.al., introduced the concept of divisor cordial labeling. Let 𝐺 = (𝛿(𝐺), 𝛽(𝐺)) be a graph with p vertices and q edges. A bijective function S :  (G)  {1,2,3,….,p}is said to be a divisor cordial labeling, if an induced function S*(bc) ={ 1 (𝑠(𝑏)|𝑠(𝑐)) 𝑜𝑟(𝑠(𝑐)|𝑠(𝑏)) 0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 , ∀ bc ∈ β(G) satisfies the condition |𝛽𝑠 ∗(0)− 𝛽𝑠 ∗ (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.