2015/03/25 by Ramiro Feria-Purón, Ramiro Feria-Puron, Hebert Pérez‐Rosés +5
Computer Science · Mathematics · #05C35 #05C76 #68M10 #68W05 #Advanced Graph Theory Research #C.2.1 #Combinatorics (math.CO) #F.2.2 #FOS: Mathematics #G.2.2 #Graph theory and applications #Interconnection Networks and Systems #acm:05C35 #acm:05C76 #acm:68M10 #acm:68W05 #math.CO #msc:05C35 #msc:05C76 #msc:68M10 #msc:68W05
paper · pdf · doi:10.48550/arxiv.1503.07357
arxiv created 2015/03/25 · openalex publication_date 2015/03/25 · arxiv updated 2015/03/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.