On -labellings of lobsters and trees with a perfect matching

DOI10.1016/J.DAM.2019.05.004MaRDI QIDQ2274087zbMATH OpenOpenAlexFDO

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

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

\(\alpha\)-labellinggraceful labellinggraceful tree conjecturelobstersmaximum degree three

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)

Recommendations

• -labelings and the structure of trees with nonzero -deficit
• The L(2,1)-labelling of trees
• On γ-labelings of trees
• A note on \(L (2, 1)\)-labelling of trees
• The \(L(h,1,1)\)-labelling problem for trees
• scientific article; zbMATH DE number 7295442
• On the Laplacian coefficients of trees with a perfect matching
• scientific article; zbMATH DE number 2197903
• \(\alpha\)-labeling number of trees
• \(\alpha \)-domination perfect trees

Cites work

• -labelings and the structure of trees with nonzero -deficit
• Another equivalent of the graceful tree conjecture
• Bipartite labeling of trees with maximum degree three
• scientific article; zbMATH DE number 3815667 (Why is no real title available?)
• scientific article; zbMATH DE number 3698968 (Why is no real title available?)
• scientific article; zbMATH DE number 568853 (Why is no real title available?)
• scientific article; zbMATH DE number 3435497 (Why is no real title available?)
• scientific article; zbMATH DE number 6459026 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• scientific article; zbMATH DE number 2230306 (Why is no real title available?)
• Improved bounds for relaxed graceful trees
• Labellings of trees with maximum degree three -- an improved bound
• Lobsters with an almost perfect matching are graceful
• On the embedding of cone graphs in the line with distinct distances between neighbors
• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• Some graceful lobsters with both odd and even degree vertices on the central path
• Some graceful three distant trees by component moving operation
• Some new classes of graceful lobsters obtained from diameter four trees
• The gracefulness of a class of lobster trees

Cited in

(6)

• A counterexample to a conjecture of Ghosh
• All lobsters with perfect matchings are graceful
• Trees which admit no -labelings.
• -labelings and the structure of trees with nonzero -deficit
• Labellings of trees with maximum degree three -- an improved bound
• On graceful colorings in subcubic trees

This page was built for publication: On \(\alpha\)-labellings of lobsters and trees with a perfect matching

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