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.

Let G = (V,E) be a graph with n vertices and f : V (G) → {1, 2, . . . , n} be a bijective function. We define the minimum edge difference as ab(G, f) = min{|f(u)− f(v)| : (u, v) ∈ E}. We say that f is a k-antibandwidth labeling on G if ab(G, f) ≥ k. Let ab(G) = maxf{ab(G, f)}. We therefore investigate the lower bound of ab(G). In other words, to what extent can we maximize the minimum edge diff...