OPTIMAL AVERAGE MESSAGE-PASSING DENSITY IN MOORE GRAPHS

Authors
NANAVATI AA IYENGAR SS
Citation
Aa. Nanavati et Ss. Iyengar, OPTIMAL AVERAGE MESSAGE-PASSING DENSITY IN MOORE GRAPHS, Applied mathematics letters, 7(5), 1994, pp. 67-70
Citations number
9
Categorie Soggetti
Mathematics,Mathematics
Journal title
Applied mathematics letters → ACNP
ISSN journal
08939659
Volume
7
Issue
5
Year of publication
1994
Pages
67 - 70
Database
ISI
SICI code
0893-9659(1994)7:5<67:OAMDIM>2.0.ZU;2-N
Abstract
Moore graphs are compact graphs. As interconnection networks, they wou ld minimize communication costs. We show that K-1, K-2 and the Peterse n graph are the only Moore graphs that belong to epsilon(2), that is, are optimal in average message passing density. We also show that epsi lon(2) is closed under the Cartesian product (X) operation. On the bas is of these findings, a new architecture is proposed.