The Open UniversitySkip to content

A note on the number of graceful labellings of paths

Aldred, R.; Siran, M. and Siran, J. (2003). A note on the number of graceful labellings of paths. Discrete Mathematics, 261(1-3) pp. 27–30.

DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


With the help of a simple recursive construction we give a computer-assisted proof that the number of graceful labellings of a path of length n grows asymptotically at least as fast as (5/3)n. Results of this type have found surprising applications in topological graph theory.

Item Type: Journal Article
ISSN: 0012-365X
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 8089
Depositing User: Jozef Širáň
Date Deposited: 14 Jun 2007
Last Modified: 14 Jan 2016 16:32
Share this page:


Scopus Citations

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340