EDGE-ODD GRACEFUL LABELING OF UNIFORM n-WHEEL SPLIT GRAPH

In 2009, Solairaju and Chithra introduced edge - odd graceful labeling. A simple graph G with q edges is called an edge odd graceful graph, EOGG, if there is a bijection f from the edge set of the graph to the set {1,3,5,...,(2q-1)} such that when each vertex is assigned the sum of all values of the edges incident to it modulo 2q, the resulting vertex labels are distinct. The graphs related to Paths and cycles, the wheel and complete graphs, the tree and related graphs are edge-odd graceful. The prism of cycle c_n for (n≥3),the prism of star graph and prism of wheel graph are edge - odd graceful. In this paper, we dene an uniform n - wheel split graph and prove that uniform 3- wheel split graph admit edge - odd graceful labeling.