Generating graceful trees from caterpillars by recursive attachment

DOI10.1016/J.ENDM.2016.05.012MaRDI QIDQ327636zbMATH OpenOpenAlexFDO

Authors G. Sethuraman, V. Murugan

Publication date 19 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2016.05.012

zbMATH Keywords

graceful treegraceful tree conjecturegraph labeling

Mathematics Subject Classification ID

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

Recommendations

• Constructing trees with graceful labelings using caterpillars
• Graceful pairings
• New classes of graceful trees
• Generation of graceful trees from arbitrary trees
• A substitution theorem for graceful trees and its applications

Cites work

• scientific article; zbMATH DE number 3458691 (Why is no real title available?)
• scientific article; zbMATH DE number 3494442 (Why is no real title available?)
• scientific article; zbMATH DE number 3517174 (Why is no real title available?)
• scientific article; zbMATH DE number 1792634 (Why is no real title available?)
• scientific article; zbMATH DE number 3218576 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• A dynamic survey of graph labeling
• All arbitrarily fixed generalized banana trees are graceful
• All trees of diameter five are graceful
• The subdivision graph of a graceful tree is a graceful tree
• Two theorems on graceful trees

Cited in

(3)

• Constructing trees with graceful labelings using caterpillars
• Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
• Decomposition of complete graphs and complete bipartite graphs into \(\alpha \)-labelled trees

This page was built for publication: Generating graceful trees from caterpillars by recursive attachment

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