Strongly graceful trees with perfect matchings and diameters not greater than 7

zbMATH Open1265.05550MaRDI QIDQ4901059FDOQ4901059

Authors: Haixia Tao, Bing Yao, Xiangqian Zhou 

Publication date: 24 January 2013

Recommendations

• A note on strongly graceful trees.
• Some results on graceful graphs
• Strongly gracefulness of natural number sequence lobster and its series tree
• Another equivalent of the graceful tree conjecture
• Infinitely many equivalent versions of the graceful tree conjecture

zbMATH Keywords

treesperfect matchingstrongly graceful labeling

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (4)

• Some results on graceful graphs
• A note on strongly graceful trees.
• All lobsters with perfect matchings are graceful
• Strongly gracefulness of natural number sequence lobster and its series tree

This page was built for publication: Strongly graceful trees with perfect matchings and diameters not greater than 7

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