A Computational Approach to the Graceful Tree Conjecture
classification
💻 cs.DM
math.CO
keywords
gracefulconjecturetreealgorithmapproachcomputationallabellingtrees
read the original abstract
Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every tree with at most 35 vertices allows a graceful labelling, hence we verify that the graceful tree conjecture is correct for trees with at most 35 vertices.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Graceful labelings of spiders with three-edge legs and pendant leaves at the center
Every spider tree with k three-edge legs and m pendant leaves at the center is graceful for all k ≥ 1 and m ≥ 0.
-
Graceful labelings of spiders with three-edge legs and pendant leaves at the center
All spiders with k legs of length 3 and m pendant leaves at the center are graceful for every k ≥ 1 and m ≥ 0.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.