An assignment of intergers to the vertices a graph subject certain constraints is called vertex labeling src=image/13424638_01.gif>. Different types techniques are used in field coding theory, cryptography, radar, missile guidance, src=image/13424638_02.gif>-ray crystallography etc. A DCL bijective function src=image/13424638_03.gif> from node set src=image/13424...

Let f : V (G) → {1, 2,..., |V (G)|} be a bijection, and let us denote S = f(u) + f(v) D |f(u) − f(v)| for every edge uv in E(G). f' the induced labeling, by vertex labeling f, defined as E(G) {0, 1} such that any E(G), (uv)=1 if gcd(S, D)=1, (uv)=0 otherwise. ef' (0) (1) number of edges labeled with 0 1 respectively. is SD-prime cordial |ef' (1)| ≤ G graph it admits labeling. In this paper, we ...