EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS

B. Ambika, G. Balasubramanian

  DOI:  https://doi.org/10.37418/amsj.9.11.54

Full Text

A labeling of a graph $G$ with $\alpha$ vertices and $\beta$ edges called an edge odd graceful labeling if there is an edge labeling with odd numbers to all edges such that each vertex is assigned a label which is the sum $\mod (2\gamma)$ of labels of edge incident on it, where $\gamma=max\{\alpha,\beta\}$ and the induced vertex labels are distinct. In this paper, we discussed about edge odd gracefulness of some special class of flower petal graphs.

Keywords: graceful labeling, edge odd graceful labeling.