Embedding an arbitrary tree in a graceful tree

DOI10.1007/S40840-015-0210-5MaRDI QIDQ726528zbMATHOpenAlexFDO

Authors G. Sethuraman, P. Ragukumar, Peter Slater

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 treegraceful tree conjecturegraceful tree embeddinggraph labeling

Mathematics Subject Classification ID

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

Recommendations

• Towards optimal embedding of an arbitrary tree in a graceful tree
• Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph
• Every tree is a subtree of graceful tree, graceful graph and alpha-labeled graph.
• Publication:3991021
• Generation of graceful trees from arbitrary trees

Cites work

• scientific article; zbMATH DE number 5360251 (Why is no real title available?)
• scientific article; zbMATH DE number 3670474 (Why is no real title available?)
• scientific article; zbMATH DE number 3698968 (Why is no real title available?)
• scientific article; zbMATH DE number 3728287 (Why is no real title available?)
• 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 1195746 (Why is no real title available?)
• scientific article; zbMATH DE number 1925192 (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
• A new class of graceful lobsters
• A survey of graceful trees
• All arbitrarily fixed generalized banana trees are graceful
• All banana trees are graceful
• All trees of diameter five are graceful
• Decomposition of complete graphs and complete bipartite graphs into \(\alpha \)-labelled trees
• Graceful labelling: state of the art, applications and future directions
• Gracefully labeled trees from Skolem sequences
• On gracefulness of directed trees with short diameters
• Operations of interlaced trees and graceful trees
• Relaxed graceful labellings of trees
• The gracefulness of a class of lobster trees
• The subdivision graph of a graceful tree is a graceful tree
• Two theorems on graceful trees

Cited in

(4)

• Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph
• Every tree is a subtree of graceful tree, graceful graph and alpha-labeled graph.
• Towards optimal embedding of an arbitrary tree in a graceful tree
• Generating graceful unicyclic graphs from a given forest

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

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