Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62380
Title: Large digraphs with small diameter: A voltage assignment approach
Contributor(s): Baskoro, Edy Tri (author); Branković, Ljiljana  (author)orcid ; Miller, Mirka (author); Plesník, Ján (author); Ryan, Joe (author); Širáň, Jozef (author)
Publication Date: 1997
Handle Link: https://hdl.handle.net/1959.11/62380
Abstract: 

The theory of lifting voltage digraphs provides a useful tool for constructing large digraphs with given properties from suitable small base digraphs endowed with an assignment of voltages (=elements of a finite group) on arcs. We revisit the degree/diameter problem for digraphs from this new perspective and prove a general upper bound on diameter of a lifted digraph in terms of properties of the base digraph and voltage assignment. In addition, we show that all currently known largest vertex-transitive Cayley digraphs for semidirect products of groups can be described by means of a voltage assignment construction using simpler groups.

Publication Type: Journal Article
Source of Publication: Journal of Combinatorial Mathematics and Combinatorial Computing, v.24, p. 161-176
Publisher: Charles Babbage Research Centre
Place of Publication: Canada
ISSN: 0835-3026
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
Publisher/associated links: https://combinatorialpress.com/jcmcc/
Appears in Collections:Journal Article
School of Science and Technology

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

Google ScholarTM

Check


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