A proof to the odd-gracefulness of all lobsters.

MaRDI QIDQ4897463zbMATH OpenFDO

Authors Xiangqian Zhou, Bing Yao, Xiang'en Chen, Haixia Tao

Publication date 19 December 2012

zbMATH Keywords

caterpillargraceful labellinglobsterset-ordered odd-graceful labellingtree

Mathematics Subject Classification ID

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

Recommendations

• On odd-gracefulness of all symmetric trees
• On certain classes of graceful lobsters.
• Discussion of odd-graceful trees conjecture
• Graceful lobsters obtained by component moving of diameter four trees.
• A survey of graceful trees

Cited in

(5)

• A counterexample to a conjecture of Ghosh
• LOBSTERS, CRABS, AND THE ABWEHR ENIGMA
• Generalized edge-magic total labellings of models from researching networks
• On odd-gracefulness of all symmetric trees
• Graph lattices constructed by super total graceful-type labelings and colorings of topological coding

This page was built for publication: A proof to the odd-gracefulness of all lobsters.

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