A (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 T<inf>P</inf>-trees and subdivision of T<inf>P</inf>- trees are (k, d)-graceful for all positive integers k and d.
| dc.contributor.author | Hegde, S.M. | |
| dc.contributor.author | Shetty, S. | |
| dc.date.accessioned | 2026-02-05T11:00:30Z | |
| dc.date.issued | On graceful trees | |
| dc.description.abstract | 2002 | |
| dc.identifier.citation | Applied Mathematics E - Notes, 2002, 2, , pp. 192-197 | |
| dc.identifier.issn | 16072510 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/27992 | |
| dc.title | A (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 T<inf>P</inf>-trees and subdivision of T<inf>P</inf>- trees are (k, d)-graceful for all positive integers k and d. |