- Title
- Searching for large multi-loop networks
- Creator
- Feria-Purón, Ramiro; Ryan, Joe; Pérez-Rosés, Hebert
- Relation
- Electronic Notes in Discrete Mathematics Vol. 46, Issue 1, p. 233-240
- Publisher Link
- http://dx.doi.org/10.1016/j.endm.2014.08.031
- Publisher
- Elsevier BV
- Resource Type
- journal article
- Date
- 2014
- Description
- 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.
- Subject
- network design; degree/diameter problem; circulant graphs; multi-loop networks; Delannoy numbers
- Identifier
- http://hdl.handle.net/1959.13/1297683
- Identifier
- uon:19509
- Identifier
- ISSN:1571-0653
- Language
- eng
- Reviewed
- Hits: 749
- Visitors: 860
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|