Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62194
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrankovic, Ljiljanaen
dc.contributor.authorMiller, Mirkaen
dc.contributor.authorPlesník, Janen
dc.contributor.authorRyan, Joeen
dc.contributor.authorSiran, Jozefen
dc.date.accessioned2024-08-16T01:46:03Z-
dc.date.available2024-08-16T01:46:03Z-
dc.date.issued1998-
dc.identifier.citationThe Electronic Journal of Combinatorics, 5(1), p. 1-11en
dc.identifier.issn1077-8926en
dc.identifier.issn1097-1440en
dc.identifier.urihttps://hdl.handle.net/1959.11/62194-
dc.description.abstract<p>Voltage graphs are a powerful tool for constructing large graphs (called <i>lifts</i>) with prescribed properties as covering spaces of small <i>base</i> graphs. This makes them suitable for application to the <i>degree</i>/<i>diameter problem</i>, which is to determine the largest order of a graph with given degree and diameter.</p> <p>Many currently known largest graphs of degree ≤15 and diameter ≤10 have been found by computer search among Cayley graphs of semidirect products of cyclic groups. We show that <i>all</i> of them can in fact be described as lifts of smaller Cayley graphs of cyclic groups, with voltages in (other) cyclic groups. This opens up a new possible direction in the search for large vertex-transitive graphs of given degree and diameter.</p>en
dc.languageenen
dc.publisherElectronic Journal of Combinatoricsen
dc.relation.ispartofThe Electronic Journal of Combinatoricsen
dc.titleA Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignmentsen
dc.typeJournal Articleen
dc.identifier.doi10.37236/1347en
dcterms.accessRightsGolden
local.contributor.firstnameLjiljanaen
local.contributor.firstnameMirkaen
local.contributor.firstnameJanen
local.contributor.firstnameJoeen
local.contributor.firstnameJozefen
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.placeUnited States of Americaen
local.identifier.runningnumberR9en
local.format.startpage1en
local.format.endpage11en
local.peerreviewedYesen
local.identifier.volume5en
local.identifier.issue1en
local.access.fulltextYesen
local.contributor.lastnameBrankovicen
local.contributor.lastnameMilleren
local.contributor.lastnamePlesníken
local.contributor.lastnameRyanen
local.contributor.lastnameSiranen
dc.identifier.staffune-id:lbrankoven
local.profile.orcid0000-0002-5056-4627en
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:1959.11/62194en
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitleA Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignmentsen
local.relation.fundingsourcenoteThis research started when J. Plesník and J. Širáň were visiting the Department of Computer Science and Software Engineering of the University of Newcastle NSW Australia in 1995, supported by small ARC grant.en
local.output.categorydescriptionC1 Refereed Article in a Scholarly Journalen
local.search.authorBrankovic, Ljiljanaen
local.search.authorMiller, Mirkaen
local.search.authorPlesník, Janen
local.search.authorRyan, Joeen
local.search.authorSiran, Jozefen
local.open.fileurlhttps://rune.une.edu.au/web/retrieve/793d507b-76be-4328-a4fd-5395760d6e24en
local.uneassociationNoen
local.atsiresearchNoen
local.sensitive.culturalNoen
local.year.published1998en
local.fileurl.openhttps://rune.une.edu.au/web/retrieve/793d507b-76be-4328-a4fd-5395760d6e24en
local.fileurl.openpublishedhttps://rune.une.edu.au/web/retrieve/793d507b-76be-4328-a4fd-5395760d6e24en
local.subject.for2020490404 Combinatorics and discrete mathematics (excl. physical combinatorics)en
local.subject.seo2020229999 Other information and communication services not elsewhere classifieden
local.profile.affiliationtypePre-UNEen
local.profile.affiliationtypeExternal Affiliationen
local.profile.affiliationtypeExternal Affiliationen
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 
openpublished/ANoteBrankovic1998JournalArticle.pdf132.9 kBAdobe PDF
Download Adobe
View/Open
Show simple item record
Google Media

Google ScholarTM

Check

Altmetric


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