A Class of ‘n’ Distant Graceful Trees
Debdas Mishra, Amaresh C. Panda, Rajani Ballav Dash · Studies in mathematical sciences · 2011
In this paper we show that a tree T with the following properties have graceful labeling. 1) T has a path H such that every pendant vertex of T has distance n (a fixed positive integer) from H . 2) Every vertex of T excluding one end vertex of H has even degree. Key words : Graceful labeling; n distant tree; Component moving transformation; Transfer of the first type