Minimal diameter double-loop networks: Dense optimal families

DOI10.1002/net.3230210102zbMath0724.68006OpenAlexW2086405971MaRDI QIDQ3212260

Jean-Claude Bermond, Dvora Tzvieli

Publication date: 1991

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-03013377/file/78-BeTz91.pdf

zbMATH Keywords

loop networkstransmission delay

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication, information (94A99) Applications of graph theory to circuits and networks (94C15)

Related Items (9)

Connectivities of random circulant digraphs ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ The diameters of almost all Cayley digraphs ⋮ Fault-tolerant routings in double fixed-step networks ⋮ Tight-optimal circulants vis-à-vis twisted tori ⋮ Isomorphisms of circulant digraphs ⋮ Unnamed Item ⋮ On the crossing numbers of loop networks and generalized Petersen graphs

Cites Work

• A Combinatorial Problem Related to Multimodule Memory Organizations

This page was built for publication: Minimal diameter double-loop networks: Dense optimal families