Name
Abstract | ||
|---|---|---|
Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. Very limited results on this conjecture are known. In this paper, we proposed a computational approach to this conjecture by checking trees with limited size. With a hybrid algorithm, we are able to show that every tree with at most 31 nodes is harmonious, extending the best previous result in this direction. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | discrete mathematics,hybrid algorithm |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Hybrid algorithm,Labelling,Conjecture,Mathematics,Graph labelling | Journal | abs/1106.3490 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenjie Fang | 1 | 28 | 7.68 |