Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees

DOI10.1016/J.CAMWA.2005.04.006zbMath1080.05082OpenAlexW1978411600MaRDI QIDQ814305

N. E. Zubov

Publication date: 6 February 2006

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.04.006

zbMATH Keywords

transformationbranchesLobster trees

Mathematics Subject Classification ID

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

Related Items (1)

Some graceful lobsters with all three types of branches incident on the vertices of the central path

Cites Work

• The gracefulness of a class of lobster trees
• Operations of interlaced trees and graceful trees
• All trees of diameter five are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees