Let G be a (p, q) graph. Let f : V (G) → {1, 2 . . . , p} be a function. For each edge uv, assign the label |f (u)− f (v)|. f is called a difference cordial labeling if f is a one to one map and |ef… (More)

Let G be a (p, q) graph. An injective map f : V (G) → {±1,±2, · · · ,± p} is called a pair sum labeling if the induced edge function, fe : E(G) → Z − {0} defined by fe(uv) = f(u) + f(v) is one-one… (More)

Let f be a map from V(G) to . For each edge uv assign the label 0,1,2 2 f u f v . f is called a mean cordial labeling if 1 f f v i v j and 1 f f e i e j … (More)

Let G be a (p, q) graph. A one-one map f : V(G) ? {?1, ?2, ..., ?p} is said to be a pair sum labeling if the induced edge function, fe : E(G) ? Z – {0} defined by fe(uv) = f(u) + f(v) is one-one and… (More)

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 6 k 6 p. For each edge uv, assign the label |f(u)− f(v)|. f is called k-difference cordial labeling of G if… (More)

INTRODUCTION
One of the major limiting factors in retraction of proclined teeth is the width of the alveolus both in maxilla and mandible.
AIM
The objective of this study was to assess the… (More)

A square divisor cordial labeling of a graph G with vertex set V is a bijection f from V to f1; 2; : : : ; j V jg such that if each edge uv is assigned the label 1 if [f (u)]2jf (v) or [f (v)]2jf (u)… (More)