Embedding an arbitrary tree in a graceful tree

DOI10.1007/S40840-015-0210-5zbMATH Open1339.05263OpenAlexW2188233364MaRDI QIDQ726528FDOQ726528

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

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.
• scientific article; zbMATH DE number 36203
• Generation of graceful trees from arbitrary trees

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)

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
• Operations of interlaced trees and graceful trees
• On gracefulness of directed trees with short diameters
• The gracefulness of a class of lobster trees
• All banana trees are graceful
• A new class of graceful lobsters
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relaxed graceful labellings of trees
• Graceful labelling: state of the art, applications and future directions
• Gracefully labeled trees from Skolem sequences
• Decomposition of complete graphs and complete bipartite graphs into \(\alpha \)-labelled trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of graceful trees

Cited In (4)

• Every tree is a subtree of graceful tree, graceful graph and alpha-labeled graph.
• Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar 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)