Embedding an arbitrary tree in a graceful tree

DOI10.1007/s40840-015-0210-5zbMath1339.05263OpenAlexW2188233364MaRDI QIDQ726528

Peter J. Slater, P. Ragukumar, G. Sethuraman

Publication date: 11 July 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0210-5

zbMATH Keywords

graceful labelinggraceful treegraph labelinggraceful tree conjecturegraceful tree embedding

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Generating graceful unicyclic graphs from a given forest

Cites Work

• Two theorems on graceful trees
• On gracefulness of directed trees with short diameters
• Graceful labelling: state of the art, applications and future directions
• All arbitrarily fixed generalized banana trees are graceful
• The gracefulness of a class of lobster trees
• The subdivision graph of a graceful tree is a graceful tree
• A dynamic survey of graph labeling
• Operations of interlaced trees and graceful trees
• All trees of diameter five are graceful
• Relaxed graceful labellings of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding an arbitrary tree in a graceful tree