More on the graceful labeling of some graphs

For a simple graph G = (V;E), a graceful labeling f is a one-to-one map from V to the set such that when an edge xy is assigned the label f(x)􀀀f(y), the resulting edge labels are all distinct. A graph G which admits at least one graceful labeling is a graceful graph. In this paper we consider some specific graphs and study their gracefulness.