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 f(xy) = [(f(x)+f(y))/2] where x, y ∈ v (g), xy ∈ e(g), and the total number of 0, 1 and 2 are balanced. that is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). in thi...

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a function. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if ∣

Abstract A binary vertex labeling f : V (G) → Z2 of a graph G is said to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled 1. This friendly labeling induces an edge labeling f∗ : E(G) → Z2 defined by f∗(uv) = f(u)f(v) for all uv ∈ E(G). Let ef (i) = {uv ∈ E(G) : f∗(uv) = i} be the number of edges of G that are labeled i. Productcordial index of...

In this paper we investigate the pair difference cordial labeling
 behavior of Certain broken wheel graphs.

As part of the largest, longest running prospective American study of same-sex parent families, the present investigation examined relationship dissolution in planned lesbian families. Data were collected from 40 separated couples and their 17-year-old adolescent offspring—19 girls and 21 boys. Nearly all breakups occurred before the former couples could have obtained the legal equivalent of sa...