A note on constructing large Cayley graphs of given degree and diameter by voltage assignments

zbMath0885.05071MaRDI QIDQ1379133

Mirka Miller, Jozef Širáň, Ján Plesník, Ljiljana Brankovic, Joseph F. Ryan

Publication date: 18 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_5/Abstracts/v5i1r9.html

zbMATH Keywords

Cayley graphscyclic groupsvoltagesvertex-transitive graphsdiameter problembase graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (10)

Greedy routing in circulant networks ⋮ On the automorphisms of a family of small q-regular graphs of girth 8 ⋮ Construction of extremal mixed graphs of diameter two ⋮ Distance labellings of Cayley graphs of semigroups ⋮ Voltage lifts of graphs from a category theory viewpoint ⋮ Constructing goal-minimally \(k\)-diametric graphs by lifts ⋮ Unilaterally connected large digraphs and generalized cycles ⋮ Ideal basis in constructions defined by directed graphs ⋮ A note on the McKay-Miller-Širáň graphs ⋮ Asymptotically large (\(\Delta,D\))-graphs

This page was built for publication: A note on constructing large Cayley graphs of given degree and diameter by voltage assignments