Let G be a graph and f: V (G)! {1, 2, 3, . . . . . |V (G)|} be a bijection. Let puv = f(u)f(v) and duv =        hf(u) f(v) i if f(u)  f(v) hf(v) f(u)i if f(v)  f(u) for all edge uv 2 E(G). For each edge uv assign the label 1 if gcd(puv, duv) = 1 or 0 otherwise. f is called PD-prime cordial labeling if |ef (0) − ef (1)|  1 where ef (0) and ef (1) respectively denote the number of edges labelled with 0 and 1. A graph with admit a PD-prime cordial labeling is called PD-prime cordial graph.

Let G = (V, E) be a connected graph. A monophonic dominating set M is said to be a secure monophonic dominating set Sm (abbreviated as SMD set) of G if for each v∈V \M there exists u∈M such that v is adjacent to u and Sm = {M \(u)} ∪{v} is a monophonic dominating set. The minimum cardinality of a secure monophonic dominating set of G is the secure monophonic domination number of G and is denoted by γsm(G). In this paper, we investigate the secure monophonic domination number of subdivision of graphs such as subdivision of Path graph S(Pn), subdivision of Cycle graph S(Cn), subdivision of Star graph S(K1,n-1), subdivision bistar graph S(Bm,n) and subdivision of Y-tree graph S(Yn+1).