Generation of graceful trees from arbitrary trees

MaRDI QIDQ2923325zbMATH OpenFDO

Authors G. Sethuraman, P. Ragukumar

Publication date 15 October 2014

Published in Advanced Studies in Contemporary Mathematics (Kyungshang) (Search for Journal in Brave)

zbMATH Keywords

graceful graphgraceful tree conjecture

Mathematics Subject Classification ID

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

Review text

A graph \(G=(V,E)\) is graceful if there is an injection \(g:V\rightarrow \{1,\dots,\left| E\right| \}\) such that the induced edge labeling \( l(e=uv)=\left| g(u)-g(v)\right| \) is a bijection \(E\rightarrow \{1,\dots,\left| E\right| \}.\) The famous graceful tree conjecture, due to Kotzig, Ringel and Rosa, claims that each tree is graceful. In this paper, an algorithm for constructing graceful trees is provided.

Recommendations

• A survey of graceful trees
• On Graceful Labelings of Trees
• Graceful pairings
• A substitution theorem for graceful trees and its applications
• Graceful labeling algorithms and complexity -- a survey

Cited in

(13)

• A substitution theorem for graceful trees and its applications
• New families of graceful banana trees
• Operations of interlaced trees and graceful trees
• A class of sequential tree construction
• A generating algorithm for all graceful labelings of graceful graphs
• Generating graceful trees from caterpillars by recursive attachment
• scientific article; zbMATH DE number 3989398 (Why is no real title available?)
• scientific article; zbMATH DE number 1990683 (Why is no real title available?)
• Expanding graceful trees
• Binomial trees are graceful
• Graceful pairings
• Graceful labeling algorithms and complexity -- a survey
• Embedding an arbitrary tree in a graceful tree

This page was built for publication: Generation of graceful trees from arbitrary trees

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