Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62012
Title: Graceful Labelling: State of the Art, Applications and Future Directions
Contributor(s): Brankovic, Ljiljana  (author)orcid ; Wanless, Ian M (author)
Publication Date: 2011-03
DOI: 10.1007/s11786-011-0073-6
Handle Link: https://hdl.handle.net/1959.11/62012
Abstract: 

This paper takes a close look at graceful labelling and its applications. We pay special attention to the famous Graceful Tree Conjecture, which has attracted a lot of interest and engaged many researchers over the last 40+ years, and yet to this day remains unsolved. We describe applications of graceful and graceful-like labellings of trees to several well known combinatorial problems and we expose yet another one, namely the connection between α-labelling of paths and near transversals in Latin squares. Finally, we show how spectral graph theory can be used to further the progress on the Graceful Tree Conjecture.

Publication Type: Journal Article
Source of Publication: Mathematics in Computer Science, 5(1), p. 11-20
Publisher: Birkhaeuser Science
Place of Publication: Switzerland
ISSN: 1661-8289
1661-8270
Fields of Research (FoR) 2020: 490404 Combinatorics and discrete mathematics (excl. physical combinatorics)
461305 Data structures and algorithms
Socio-Economic Objective (SEO) 2020: 220499 Information systems, technologies and services not elsewhere classified
Peer Reviewed: Yes
HERDC Category Description: C1 Refereed Article in a Scholarly Journal
Appears in Collections:Journal Article
School of Science and Technology

Files in This Item:
1 files
File SizeFormat 
Show full item record

SCOPUSTM   
Citations

15
checked on Dec 14, 2024
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.