Picture of smart phone in human hand

World leading smartphone and mobile technology research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by Strathclyde researchers from the Department of Computer & Information Sciences involved in researching exciting new applications for mobile and smartphone technology. But the transformative application of mobile technologies is also the focus of research within disciplines as diverse as Electronic & Electrical Engineering, Marketing, Human Resource Management and Biomedical Enginering, among others.

Explore Strathclyde's Open Access research on smartphone technology now...

Large circulant graphs of fixed diameter and arbitrary degree

Bevan, David and Erskine, Grahame and Lewis, Robert (2017) Large circulant graphs of fixed diameter and arbitrary degree. Ars Mathematica Contemporanea, 13 (2). 275–291. ISSN 1855-3966

[img]
Preview
Text (Bevan-etal-AMC-2017-Large-circulant-graphs-of-fixed-diameter-and-arbitrary-degree)
Bevan_etal_AMC_2017_Large_circulant_graphs_of_fixed_diameter_and_arbitrary_degree.pdf - Final Published Version
License: Creative Commons Attribution 3.0 logo

Download (434kB) | Preview

Abstract

We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case. We present a direct product construction yielding improved bounds for small diameters and introduce a new general technique for “stitching” together circulant graphs which enables us to improve the current best known asymptotic orders for every diameter. As an application, we use our constructions in the directed case to obtain upper bounds on the minimum size of a subset A of a cyclic group of order n such that the k-fold sumset kA is equal to the whole group. We also present a revised table of largest known circulant graphs of small degree and diameter.