Some graceful three distant trees by component moving operation

DOI10.1007/S40819-016-0169-4MaRDI QIDQ1788288zbMATH OpenOpenAlexFDO

Authors Debdas Mishra, A. Behera, Purna Chandra Nayak

Publication date 8 October 2018

Published in International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40819-016-0169-4

zbMATH Keywords

graceful labelingcomponent moving transformationthree distant tree

Mathematics Subject Classification ID

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

Recommendations

• Graceful lobsters obtained by component moving of diameter four trees.
• Some new classes of graceful diameter six trees
• scientific article; zbMATH DE number 5717277
• Some new graceful generalized classes of diameter six trees
• Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees

Cites work

• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• A dynamic survey of graph labeling
• All trees of diameter five are graceful
• Graceful lobsters obtained by component moving of diameter four trees.
• Gracefully labeled trees from Skolem sequences

Cited in

(1)

• On \(\alpha\)-labellings of lobsters and trees with a perfect matching

This page was built for publication: Some graceful three distant trees by component moving operation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1788288)