To access the full text documents, please follow this link:

Searching for large multi-loop networks
Feria Purón, Ramiro; Pérez Rosés, Hebert; Ryan, Joe
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.
Network design
Circulant graphs
Multi-loop networks
Delannoy numbers
Xarxes d'ordinadors
Teoria de grafs
Computer networks
Graph theory
(c) Elsevier, 2014

Full text files in this document

Files Size Format View
022221.pdf 197.1 KB application/pdf View/Open

Show full item record

Related documents

Other documents of the same author