Academic Journals Database
Disseminating quality controlled scientific knowledge

A Class of ā€˜nā€™ Distant Graceful Trees

ADD TO MY LIST
 
Author(s): Debdas Mishra | Amaresh Chandra Panda | Rajani Ballav Dash

Journal: Studies in Mathematical Sciences
ISSN 1923-8444

Volume: 3;
Issue: 2;
Start page: 21;
Date: 2011;
Original page

Keywords: Graceful labeling | n distant tree | Component moving transformation | Transfer of the first type

ABSTRACT
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
RPA Switzerland

Robotic Process Automation Switzerland

    

Tango Jona
Tangokurs Rapperswil-Jona