Please use this identifier to cite or link to this item: https://idr.l3.nitk.ac.in/jspui/handle/123456789/12356
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.-
dc.contributor.authorShetty, S.-
dc.date.accessioned2020-03-31T08:39:04Z-
dc.date.available2020-03-31T08:39:04Z-
dc.date.issued2002-
dc.identifier.citationApplied Mathematics E - Notes, 2002, Vol.2, , pp.192-197en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12356-
dc.description.abstractA (p, q)-graph G = (V,E) is said to be (k, d)-graceful, where k and d are positive integers, if its p vertices admits an assignment of a labeling of numbers 0, 1, 2, ..., k + (q - 1)d such that the values on the edges defined as the absolute difference of the labels of their end vertices form the set {k, k + d, ..., k + (q - 1)d}. In this paper we prove that a class of trees called TP-trees and subdivision of TP- trees are (k, d)-graceful for all positive integers k and d.en_US
dc.titleOn graceful treesen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
9 On Graceful Trees.pdf184.72 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.