Paper Info
Title
A Computational Approach to the Graceful Tree Conjecture
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.
Year
Venue
Keywords
2010
Clinical Orthopaedics and Related Research
graph theory,discrete mathematics
Field
DocType
Volume
Graph theory,Discrete mathematics,Combinatorics,Open problem,Vertex (geometry),K-ary tree,Conjecture,Collatz conjecture,Mathematics
Journal
abs/1003.3
Citations 
PageRank 
References 
2
0.48
1
Authors
1
Name
Order
Citations
PageRank
Wenjie Fang1287.68