| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651856 | Electronic Notes in Discrete Mathematics | 2014 | 8 Pages |
Abstract
We describe and implement a computer-based method to find large multi-loop graphs with given degree and diameter. For some values of degree and diameter, our algorithm produces the largest known circulant graphs. We summarize our findings in a table.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
