Searching for large multi-loop networks
| dc.contributor.author | Feria Purón, Ramiro | |
| dc.contributor.author | Pérez Rosés, Hebert | |
| dc.contributor.author | Ryan, Joe | |
| dc.date.accessioned | 2015-02-19T09:53:29Z | |
| dc.date.embargoEndDate | 2025-01-01 | |
| dc.date.issued | 2014 | |
| dc.date.updated | 2015-02-19T09:53:29Z | |
| dc.description.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 diame- ter, our algorithm produces the largest known circulant graphs. We summarize our findings in a table. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.doi | https://doi.org/10.1016/j.endm.2014.08.031 | |
| dc.identifier.idgrec | 022221 | |
| dc.identifier.issn | 1571-0653 | |
| dc.identifier.uri | http://hdl.handle.net/10459.1/47996 | |
| dc.language.iso | eng | |
| dc.publisher | Elsevier | |
| dc.relation.isformatof | Reproducció del document publicat a https://doi.org/10.1016/j.endm.2014.08.031 | |
| dc.relation.ispartof | Electronic Notes in Discrete Mathematics, 2014, vol. 46, p. 233-240 | |
| dc.rights | (c) Elsevier, 2014 | |
| dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | |
| dc.subject | Network design | |
| dc.subject | Circulant graphs | |
| dc.subject | Multi-loop networks | |
| dc.subject | Delannoy numbers | |
| dc.subject.classification | Xarxes d'ordinadors | |
| dc.subject.classification | Teoria de grafs | |
| dc.subject.other | Computer networks | |
| dc.subject.other | Graph theory | |
| dc.title | Searching for large multi-loop networks | |
| dc.type | info:eu-repo/semantics/article | |
| dc.type.version | publishedVersion | |