Pages: 170-173
Date of Publication: 30-Nov--0001
Not all wheel graphs were Edge-graceful
Author: S.Venkatesan1, P.Sekar.2
Category: Engineering, Science and Mathematics
Abstract:
Graceful labeling is assignment of distinct labels from f {0,…., |E|} to vertices of graph, where edges are labeled by difference of absolute values of adjacent vertices and every label from f {1,2,….,|E|} is used exactly once as an edge label. Edge – graceful graphs were defined by Sheng-Ping in 1985 is originated from graceful graphs. In fact, edge – gracefulness is reversal of gracefulness. It involves labeling edges, rather than vertices, with an induced numbering consisting of sums of edge- labels, rather than differences of vertex labels. In this paper, we are discussing about the edge graceful labeling of wheel graphs and related results
Keywords: graph labeling, graceful labeling, edge - graceful labeling, wheel graph.
|
