All arbitrarily fixed generalized banana trees are graceful

DOI10.1007/s11786-011-0083-4zbMath1254.05174OpenAlexW2039214257MaRDI QIDQ691631

G. Sethuraman, J. Jeba Jesintha

Publication date: 3 December 2012

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-011-0083-4

zbMATH Keywords

graceful labelingbanana trees

Mathematics Subject Classification ID

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

Related Items (6)

Generating graceful trees from caterpillars by recursive attachment ⋮ A class of diameter six trees exhibiting graceful labeling ⋮ Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees ⋮ Binomial trees are graceful ⋮ Embedding an arbitrary tree in a graceful tree ⋮ Some new graceful generalized classes of diameter six trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions of complete graphs into isomorphic cubes
• The gracefulness of a class of lobster trees
• Operations of interlaced trees and graceful trees
• All trees of diameter five are graceful

This page was built for publication: All arbitrarily fixed generalized banana trees are graceful