The gracefulness of a class of lobster trees

DOI10.1016/0895-7177(94)00167-7zbMath0814.05063OpenAlexW2039164984MaRDI QIDQ1344643

J.-G. Wang, Xiguan Lu, Dejun Jin, Deyu Zhang

Publication date: 11 April 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(94)00167-7

zbMATH Keywords

gracefulnesslobster trees

Mathematics Subject Classification ID

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

Related Items (13)

Edge-decompositions ofK_n,ninto isomorphic copies of a given tree ⋮ Computer search for graceful labeling: a survey ⋮ Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees ⋮ Investigating several fundamental properties of random lobster trees and random spider trees ⋮ Binomial trees are graceful ⋮ Graceful labelling: state of the art, applications and future directions ⋮ All arbitrarily fixed generalized banana trees are graceful ⋮ On \(\alpha\)-labellings of lobsters and trees with a perfect matching ⋮ Embedding an arbitrary tree in a graceful tree ⋮ Some graceful lobsters with all three types of branches incident on the vertices of the central path ⋮ A new class of graceful rooted trees ⋮ Graceful Labeling of Balanced Stars of Paths ⋮ Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees

Cites Work

• Parallel concepts in graph theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The gracefulness of a class of lobster trees