This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Pentagonal Graceful Labeling of Caterpillar Graphs
Authors
M.P. Syed Ali Nisaya, D.S.T. Ramesh
Abstract
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.
Publication Details
Unique Identification Number - IJEDR1804027Page Number(s) - 150-154Pubished in - Volume 6 | Issue 4 | November 2018DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
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
Article Preview
|
|
||||||
|
|
||||||||
