A proof to the odd-gracefulness of all lobsters.

<a class="pub-badge pub-badge--grey" href="https://zbmath.org/1265.05558" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q4897463" rel="nofollow">MaRDI QID Q4897463</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q4897463" rel="nofollow">FDO</a>

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

Publication date 19 December 2012

zbMATH Keywords

treecaterpillarlobstergraceful labellingset-ordered odd-graceful labelling

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

(4)

• 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

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)