A class of trees having strongly graceful labellings

DOI10.13413/J.CNKI.JDXBLXB.2016.02.12MaRDI QIDQ2990558zbMATH OpenFDO

Authors Xiyang Zhao, Fei Ma, Bing Yao

Publication date 10 August 2016

zbMATH Keywords

perfect matchingstrongly graceful labellings

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)

Recommendations

• scientific article; zbMATH DE number 6719738
• On certain classes of graceful lobsters.
• A new method for proving strongly \((k, d)\)-graceful trees
• A survey of graceful trees
• Graceful labelings of super-subdivision of \(F\)-tree and \(P^+_n\)-tree

Cited in

(10)

• A new class of graceful rooted trees
• Modular gracious labellings of trees
• scientific article; zbMATH DE number 6863837 (Why is no real title available?)
• On set-ordered strong gracefulness of a graph space
• On Graceful Labelings of Trees
• 0-centred and 0-ubiquitously graceful trees.
• New classes of graceful trees
• Gracefully labeled trees from Skolem sequences
• A class of diameter six trees exhibiting graceful labeling
• A new method for proving strongly \((k, d)\)-graceful trees

This page was built for publication: A class of trees having strongly graceful labellings

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