Some graceful three distant trees by component moving operation

DOI10.1007/S40819-016-0169-4zbMath1397.05159OpenAlexW2313757358MaRDI QIDQ1788288

Purna Chandra Nayak, Debdas Mishra, Amiya Kumar Behera

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)

Related Items (1)

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

Cites Work

• A dynamic survey of graph labeling
• All trees of diameter five are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item

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