Lucas Graceful Labeling for TP –Tree

Abstract :

Let G be a (p,q)-graph. An injective function f : V(G) →{ l0, l1, l2, l3. . .la},(a є N), is said to be Lucas graceful labeling if an induced edge labeling f1( uv )= | f(u)- f(v) | is a bijection onto the set { l1, l 2, l 3. . .lq}. Then G is called Lucas graceful graph if it admits Lucas graceful labeling. In this paper, we show that the Transformed Tree (TP-Tree) is Lucas graceful graph.

Author Name : R. Jenipa

Keywords: Graceful labeling, Lucas Graceful labeling and Lucas graceful graph.