The gracefulness of a class of lobster trees

DOI10.1016/0895-7177(94)00167-7zbMATH Open0814.05063OpenAlexW2039164984MaRDI QIDQ1344643FDOQ1344643

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

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)

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (17)

• Title not available (Why is that?)
• Binomial trees are graceful
• Graceful labelling: state of the art, applications and future directions
• Title not available (Why is that?)
• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• Graceful Labeling of Balanced Stars of Paths
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• On \(\alpha\)-labellings of lobsters and trees with a perfect matching
• All arbitrarily fixed generalized banana trees are graceful
• Embedding an arbitrary tree in a graceful tree
• 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
• Discussing the gracefulness of Fibonacci lobster trees
• New classes of graceful trees
• Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
• Computer search for graceful labeling: a survey
• A new class of graceful rooted trees

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

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