The gracefulness of a class of lobster trees
From MaRDI portal
Publication:1344643
The four authors deal with a special class of lobster trees and show their gracefulness.
Cites work
- Graph theory with applications
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 3815667 (Why is no real title available?)
- scientific article; zbMATH DE number 3663030 (Why is no real title available?)
- scientific article; zbMATH DE number 1763383 (Why is no real title available?)
- Parallel concepts in graph theory
Cited in
(17)- Some graceful lobsters with all three types of branches incident on the vertices of the central path
- New classes of graceful trees
- On \(\alpha\)-labellings of lobsters and trees with a perfect matching
- 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
- scientific article; zbMATH DE number 5844248 (Why is no real title available?)
- A new class of graceful rooted trees
- Edge-decompositions ofKn,ninto isomorphic copies of a given tree
- Graceful Labeling of Balanced Stars of Paths
- scientific article; zbMATH DE number 5717277 (Why is no real title available?)
- Computer search for graceful labeling: a survey
- Binomial trees are graceful
- Graceful labelling: state of the art, applications and future directions
- All arbitrarily fixed generalized banana trees are graceful
- Embedding an arbitrary tree in a graceful tree
- Graceful lobsters obtained by partitioning and component moving of branches of diameter four 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)
