Efficient enumeration of graceful permutations

Details Efficient enumeration of graceful permutations Efficient enumeration of graceful permutations

2006-08-21

arxiv.org/abs/math/0608513v1

Mathematics

Combinatorics

5 pages, 1 figure

Scientific paper

A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In
this paper we improve the asymptotic lower bound on the number of such
permutations from (5/3)^n to 2.37^n. This is a computer-assisted proof based on
an effective algorithm that enumerates graceful n-permutations. Our algorithm
is also presented in detail.

Affiliated with

Also associated with

No associations

Rating

Efficient enumeration of graceful permutations 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 Efficient enumeration of graceful permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient enumeration of graceful permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-666780