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)

OBJECTIVE
To assess the effect of experienced stigma on depth of multidimensional poverty of persons with severe mental illness (PSMI) in Delhi, India, controlling for gender, age and caste.
DESIGNâ€¦ (More)

A graph G = (V, E) with p vertices and q edges is said to be a Total Mean Cordial graph if there exists a function f : V (G) â†’ {0, 1, 2} such that for each edge xy assign the label f (x)+f (y) 2â€¦ (More)

A radio mean labeling of a connected graph G is a one to one map f from the vertex set V (G) to the set of natural numbers N such that for each distinct vertices u and v of G, d (u, v) + âŒˆ f(u)+f(v)â€¦ (More)

BACKGROUND
Cognitive functions are important prognostic factors for schizophrenia (SZ), while ability to perform activities of daily living are important measures of functional capacity. Theâ€¦ (More)

Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivison of a star, bistar, double comb, corona of tree with a vertex, crown, olive tree and otherâ€¦ (More)