Radio Mean Graceful Labeling on Splitting of Wheel Related Graphs

Abstract

Radio Mean Graceful Labeling of a connected graph G is a bijection : V(G)  {1, 2, 3, …, |V|} satisfying the condition d(u, v) +  ≥ 1 + diam(G), for every u, v ϵ V(G). A graph which admits radio mean graceful labeling is called radio mean graceful graph.In this paper we investigate the radio meangraceful labeling on splitting graph of Wheel, Helm, and Closed Helm and Flower graph.