On \(\alpha\)-labellings of lobsters and trees with a perfect matching

DOI10.1016/j.dam.2019.05.004zbMath1419.05188OpenAlexW2947688929MaRDI QIDQ2274087

R. Bruce Richter, C. N. Campos, Atílio G. Luiz

Publication date: 19 September 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.05.004

zbMATH Keywords

graceful tree conjecturegraceful labellingmaximum degree threelobsters\(\alpha\)-labelling

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• The gracefulness of a class of lobster trees
• On the embedding of cone graphs in the line with distinct distances between neighbors
• Some graceful three distant trees by component moving operation
• Improved bounds for relaxed graceful trees
• Some new classes of graceful Lobsters obtained from diameter four trees
• Bipartite labeling of trees with maximum degree three
• Lobsters with an almost perfect matching are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item