A Class of ‘n’ Distant Graceful Trees

Debdas Mishra, Amaresh Chandra Panda, Rajani Ballav Dash

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

Keywords


Graceful labeling; n distant tree; Component moving transformation; Transfer of the first type

Full Text:

PDF


DOI: http://dx.doi.org/10.3968%2Fj.sms.1923845220110302.220

Refbacks

  • There are currently no refbacks.


Reminder

If you have already registered in Journal A and plan to submit article(s) to Journal B, please click the CATEGORIES, or JOURNALS A-Z on the right side of the "HOME".


We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
caooc@hotmail.com; sms@cscanada.net; sms@cscanada.org

Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures
Address: 730, 77e AV, Laval, Quebec, H7V 4A8, Canada

Telephone: 1-514-558 6138
Http://www.cscanada.net
Http://www.cscanada.org
E-mail:caooc@hotmail.com