Indian Journal of Science and Technology
Year: 2022, Volume: 15, Issue: 14, Pages: 630-639
Gobind Mohanty1, Debdas Mishra2, Pravat Sarangi3, Subarna Bhattacharjee1*
1Department of Mathematics, Ravenshaw University, Cuttack, Odisha, India
2Former Professor, C.V. Raman College of Engineering, Bhubaneswar, Odisha, India
3Department of Statistics, Ravenshaw University, Cuttack, Odisha, India
Email: [email protected]
Received Date:30 January 2022, Accepted Date:04 March 2022, Published Date:11 April 2022
Objectives: To identify a new family of (k; d) graceful graphs. Methods : The methodology involves mathematical formulation for labeling of the vertices of a given graph and subsequently establishing that these formulations give rise to (k;d) graceful labeling. Findings: Here we define a three-distance tree as the tree possessing a path such that each vertex of the tree is at most at a distance three from that path. In this paper we identify two families of three distance trees that possess (k; d) graceful labeling. Furthermore, we show that the three distance unicyclic graphs obtained from these three distance trees by joining two end vertices of their central paths are also (k; d) graceful. Novelty: Here, we give (k; d) graceful labeling to two new families of graphs, namely some classes of three distance trees and three distance unicyclic graphs. This effort is the first of its kind which involves exploration of 3-distance (k; d) graceful graphs.
Keywords: (k; D); graceful labelling; Hairy cycle; Firecracker; Three distance tree; Three distance unicyclic graphs
© 2022 Mohanty et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Published By Indian Society for Education and Environment (iSee)
Subscribe now for latest articles and news.