Generating graceful trees from caterpillars by recursive attachment

DOI10.1016/j.endm.2016.05.012zbMath1347.05220OpenAlexW2509677544MaRDI QIDQ327636

G. Sethuraman, Veerapazham Murugan

Publication date: 19 October 2016

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

zbMATH Keywords

graceful treegraph labelinggraceful tree conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Two theorems on graceful trees
• All arbitrarily fixed generalized banana trees are graceful
• The subdivision graph of a graceful tree is a graceful tree
• A dynamic survey of graph labeling
• All trees of diameter five are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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