Pentagonal Graceful Labeling of Caterpillar Graphs
M.P. Syed Ali Nisaya,  D.S.T. Ramesh
A graph G = (V, E) with p vertices and q edges is said to admit pentagonal graceful labeling if its vertices can be labeled by non negative integers such that the induced edge labels obtained by the absolute difference of the labels of end vertices are the first q pentagonal numbers. A graph G which admits pentagonal graceful labeling is called a pentagonal graceful graph. In this paper, we prove that Caterpillar is a pentagonal graceful graph.
Keywords- Pentagonal number, pentagonal graceful labeling, pentagonal graceful graph.
Cite this Article
M.P. Syed Ali Nisaya,  D.S.T. Ramesh,   "Pentagonal Graceful Labeling of Caterpillar Graphs"
, International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.6, Issue 4, pp.150-154, November 2018, Available at :http://www.ijedr.org/papers/IJEDR1804027.pdf