Generating graceful trees from caterpillars by recursive attachment

DOI10.1016/J.ENDM.2016.05.012zbMATH Open1347.05220OpenAlexW2509677544MaRDI QIDQ327636FDOQ327636

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

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

zbMATH Keywords

graceful treegraceful tree conjecturegraph labeling

Mathematics Subject Classification ID

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

Cites Work

• A dynamic survey of graph labeling
• The subdivision graph of a graceful tree is a graceful tree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• All trees of diameter five are graceful
• Two theorems on graceful trees
• All arbitrarily fixed generalized banana trees are graceful

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)