Let G be a graph with p vertices and q edges. A centered polygonal graceful labeling of a graph G is a one to one function l : V (G ) ® {0,1,2,..., C ( q )} where C (q ) is the q th centered polygonal number that induces a bijection l* : E (G ) ® {C (1), C ( 2 ),..., C ( q )} such that l* (uv ) = | l (u ) - l (v ) | for every edge f * (e ) = f (u ) - f (v) , " e = uv Î E (G ) . A graph which admits such a labeling is called a centered polygonal graceful graph. For k = 3 , the above labeling gives centered triangular graceful labeling. For k = 4 , the above labeling gives centered tetragonal graceful labeling and so on. In this paper, centered polygonal graceful labeling of some graphs are studied.
" />1. A. RAMA LAKSHMI - Research Scholar (Part time-Internal), Department of Mathematics, The M.D.T Hindu College, Tirunelveli & Affiliated to Manonmaniam Sundaranar University, Abishekappatti, Tirunelveli. Tamil Nadu, India.
2.. M.P. SYED ALI NISAYA - Assistant Professor, Department of Mathematics, the M.D.T Hindu College, Tirunelveli. Affiliated to
Manonmaniam Sundaranar University, Abishekappatti, Tirunelveli. Tamil Nadu, India.
Let G be a graph with p vertices and q edges. A centered polygonal graceful labeling of a graph G is a one to one function l : V (G ) ® {0,1,2,..., C ( q )} where C (q ) is the q th centered polygonal number that induces a bijection l* : E (G ) ® {C (1), C ( 2 ),..., C ( q )} such that l* (uv ) = | l (u ) - l (v ) | for every edge f * (e ) = f (u ) - f (v) , " e = uv Î E (G ) . A graph which admits such a labeling is called a centered polygonal graceful graph. For k = 3 , the above labeling gives centered triangular graceful labeling. For k = 4 , the above labeling gives centered tetragonal graceful labeling and so on. In this paper, centered polygonal graceful labeling of some graphs are studied.
Banana tree, Centered polygonal graceful graph, centered polygonal graceful labeling, Centered polygonal numbers, Corona graph, F-tree, Graceful labeling, Star graph, Y-tree.