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

DOI10.1016/J.CAMWA.2008.02.034zbMath1155.05335OpenAlexW2073901273MaRDI QIDQ1004820

Pratima Panigrahi, Debdas Mishra

Publication date: 12 March 2009

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

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

zbMATH Keywords

graceful labelinglobsterBD8TFcomponent moving transformationtransfers of the first and second type

Mathematics Subject Classification ID

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

Related Items (4)

A class of diameter six trees exhibiting graceful labeling ⋮ On \(\alpha\)-labellings of lobsters and trees with a perfect matching ⋮ Unnamed Item ⋮ Some new graceful generalized classes of diameter six trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
• The gracefulness of a class of lobster trees
• Operations of interlaced trees and graceful trees
• All trees of diameter five are graceful

This page was built for publication: Some graceful lobsters with all three types of branches incident on the vertices of the central path