Graceful lobsters obtained by component moving of diameter four trees.

MaRDI QIDQ5310213zbMATH OpenFDO

Authors Debdas Mishra, Pratima Panigrahi

Publication date 21 September 2007

zbMATH Keywords

graceful labelinglobster

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5717277
• Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
• scientific article; zbMATH DE number 5844248
• Some new classes of graceful lobsters obtained from diameter four trees
• Some graceful lobsters with all three types of branches incident on the vertices of the central path

Cited in

(11)

• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• Some graceful three distant trees by component moving operation
• Improved bounds for relaxed graceful trees
• A counterexample to a conjecture of Ghosh
• scientific article; zbMATH DE number 5844248 (Why is no real title available?)
• All lobsters with perfect matchings are graceful
• scientific article; zbMATH DE number 5717277 (Why is no real title available?)
• A new class of graceful lobsters
• On certain classes of graceful lobsters.
• A proof to the odd-gracefulness of all lobsters.
• Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees

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

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