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

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

Let G = (V, E) be a simple graph with p vertices and q edges. For connected of diameter d, radio mean labeling is one to mapping f from V(G) N satisfying the condition for every μ, ν ∈ V (G). The span maximum integer that maps vertex G. number G, rmn(G) lowest taken over all labelings In this paper, we analyze some splitting graphs labeling.