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.

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

An antimagic labeling of a graph withm edges and n vertices is a bijection from the set of edges to the integers 1; . . . ;m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it has an antimagic labeling. In [10], Ringel conjectured that every simple connected graph, other than K2, is...

An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that the vertex sums are pairwise distinct, where the vertex sum at one vertex is the sum of labels of all edges incident to such vertex. A graph is called anti-magic if it admits an anti-magic labeling. Hartsfield and Ringel c...

A labeling of edges and vertices a simple graph \(G(V,E)\) by mapping \(\Lambda :V\left( G \right) \cup E\left( \to \left\{ { 1,2,3, \ldots ,\Psi } \right\}\) provided that any two pair have distinct weights is called an edge irregular total \(\Psi\)-labeling. If \(\Psi\) minimum \(G\) admits -labelling, then the irregularity strength (TEIS) denoted \(\mathrm{tes}\left(G\right).\) In this paper...

Let G = (V, E) be a simple graph. A vertex labeling f : V → {0, 1} induces a partial edge labeling f ∗ : E → {0, 1} defined by f ∗(uv) = f(u) 84 KWONG, LEE, LO, SU AND WANG if and only if f(u) = f(v). For i = 0, 1, let vf(i) = |{v ∈ V : f(v) = i}|, and ef (i) = |{e ∈ E : f ∗(e) = i}|. A graph G is uniformly balanced if |ef (0)−ef (1)| ≤ 1 for any vertex labeling f that satisfies |vf(0)−vf (1)| ...

A Radio Heronian Mean Dd-distance Labeling of a connected graph is an injective map from the vertex set N such that for two distinct vertices and , Dd where denotes between Dd-diameter G.