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/j.sms.1923845220110302.220

DOI (PDF): http://dx.doi.org/10.3968/g2240

Refbacks

  • There are currently no refbacks.


Copyright (c)




Share us to:   


Please send your manuscripts to sms@cscanada.net,or  sms@cscanada.org  for consideration. We look forward to receiving your work.

 

 Articles published in Studies in Mathematical Sciences are licensed under Creative Commons Attribution 4.0 (CC-BY).

 STUDIES IN MATHEMATICAL SCIENCES Editorial Office

Address: 1055 Rue Lucien-L'Allier, Unit #772, Montreal, QC H3G 3C4, Canada.

Telephone: 1-514-558 6138

Http://www.cscanada.net
Http://www.cscanada.org
E-mail:caooc@hotmail.com

Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures