Let D = (V, A)be a digraph. An injective function f: V(D) → {1,2, .... p} is said to be sign pairity difference cordial labeling if the induced arc f∗: A(D) {0,1} defined byf∗ ((μ, ν)) satisfiesthe condition that |ef 0-ef(1)| ≤ 1 where, ef(0) number of arcs with label 0 and ef(1) 1. In this paper, we analyze existence in digraphs Directed Path , Cycle, Outstar, Inwheel Downcomb by K.Palani et.al.

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...