A class of diameter six trees exhibiting graceful labeling

DOI10.1080/09720529.2014.1001591zbMath1495.05298OpenAlexW2566384944MaRDI QIDQ5069837

Debdas Mishra, Amaresh Chandra Panda, Rajani Ballav Dash

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2014.1001591

zbMATH Keywords

graceful labelingBD8TFcomponent moving transformationdiameter six treetransfers of the first and second types

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Unnamed Item ⋮ Directed edge-graceful labeling of digraph consisting of c cycles of the same size

Cites Work

• All arbitrarily fixed generalized banana trees are graceful
• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• New families of graceful banana trees
• A dynamic survey of graph labeling
• Operations of interlaced trees and graceful trees
• A new class of graceful rooted trees
• Singular vectors of orthogonally decomposable tensors
• All trees of diameter five are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of diameter six trees exhibiting graceful labeling