A Computational Approach to the Graceful Tree Conjecture

Details A Computational Approach to the Graceful Tree Conjecture A Computational Approach to the Graceful Tree Conjecture

2010-03-15

arxiv.org/abs/1003.3045v2

Computer Science

Discrete Mathematics

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Computational Approach to the Graceful Tree Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Computational Approach to the Graceful Tree Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Computational Approach to the Graceful Tree Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-244656