Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62194
Title: A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Contributor(s): Brankovic, Ljiljana  (author)orcid ; Miller, Mirka (author); Plesník, Jan (author); Ryan, Joe (author); Siran, Jozef (author)
Publication Date: 1998
Open Access: Yes
DOI: 10.37236/1347Open Access Link
Handle Link: https://hdl.handle.net/1959.11/62194
Abstract: 

Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for application to the degree/diameter problem, which is to determine the largest order of a graph with given degree and diameter.

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 all 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.

Publication Type: Journal Article
Source of Publication: The Electronic Journal of Combinatorics, 5(1), p. 1-11
Publisher: Electronic Journal of Combinatorics
Place of Publication: United States of America
ISSN: 1077-8926
1097-1440
Fields of Research (FoR) 2020: 490404 Combinatorics and discrete mathematics (excl. physical combinatorics)
Socio-Economic Objective (SEO) 2020: 229999 Other information and communication 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 
openpublished/ANoteBrankovic1998JournalArticle.pdf132.9 kBAdobe PDF
Download Adobe
View/Open
Show full item record
Google Media

Google ScholarTM

Check

Altmetric


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