Searching for Large Circulant Graphs
From MaRDI portal
Publication:6260281
arXiv1503.07357MaRDI QIDQ6260281FDOQ6260281
Authors: Ramiro Feria-Purón, Hebert Pérez-Rosés, Joe Ryan 
Publication date: 25 March 2015
Abstract: We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to find large circulant graphs with given parameters. For several combinations of degree and diameter, our algorithm produces the largest known circulant graphs. We summarize our findings in a table, up to degree 15 and diameter 10, and we perform a statistical analysis of this table, which can be useful for evaluating the performance of our methods, as well as other constructions in the future.
Extremal problems in graph theory (05C35) Nonnumerical algorithms (68W05) Graph operations (line graphs, products, etc.) (05C76) Network design and communication in computer systems (68M10)
This page was built for publication: Searching for Large Circulant Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6260281)
