Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62012
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrankovic, Ljiljanaen
dc.contributor.authorWanless, Ian Men
dc.date.accessioned2024-08-08T00:09:19Z-
dc.date.available2024-08-08T00:09:19Z-
dc.date.issued2011-03-
dc.identifier.citationMathematics in Computer Science, 5(1), p. 11-20en
dc.identifier.issn1661-8289en
dc.identifier.issn1661-8270en
dc.identifier.urihttps://hdl.handle.net/1959.11/62012-
dc.description.abstract<p>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.</p>en
dc.languageenen
dc.publisherBirkhaeuser Scienceen
dc.relation.ispartofMathematics in Computer Scienceen
dc.titleGraceful Labelling: State of the Art, Applications and Future Directionsen
dc.typeJournal Articleen
dc.identifier.doi10.1007/s11786-011-0073-6en
local.contributor.firstnameLjiljanaen
local.contributor.firstnameIan Men
local.profile.schoolSchool of Science and Technologyen
local.profile.emaillbrankov@une.edu.auen
local.output.categoryC1en
local.record.placeauen
local.record.institutionUniversity of New Englanden
local.publisher.placeSwitzerlanden
local.format.startpage11en
local.format.endpage20en
local.peerreviewedYesen
local.identifier.volume5en
local.identifier.issue1en
local.title.subtitleState of the Art, Applications and Future Directionsen
local.contributor.lastnameBrankovicen
local.contributor.lastnameWanlessen
dc.identifier.staffune-id:lbrankoven
local.profile.orcid0000-0002-5056-4627en
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:1959.11/62012en
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitleGraceful Labellingen
local.output.categorydescriptionC1 Refereed Article in a Scholarly Journalen
local.search.authorBrankovic, Ljiljanaen
local.search.authorWanless, Ian Men
local.uneassociationNoen
local.atsiresearchNoen
local.sensitive.culturalNoen
local.year.published2011en
local.fileurl.closedpublishedhttps://rune.une.edu.au/web/retrieve/817d1846-01c8-45ff-b545-fcdd49598406en
local.subject.for2020490404 Combinatorics and discrete mathematics (excl. physical combinatorics)en
local.subject.for2020461305 Data structures and algorithmsen
local.subject.seo2020220499 Information systems, technologies and services not elsewhere classifieden
local.profile.affiliationtypeExternal Affiliationen
local.profile.affiliationtypeExternal Affiliationen
Appears in Collections:Journal Article
School of Science and Technology
Files in This Item:
1 files
File SizeFormat 
Show simple item record

SCOPUSTM   
Citations

15
checked on Nov 2, 2024
Google Media

Google ScholarTM

Check

Altmetric


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