New dense families of triple loop networks

DOI10.1016/S0012-365X(99)90033-XzbMath0929.05038OpenAlexW4213330025MaRDI QIDQ1292809

F. Aguiló-Gost

Publication date: 25 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90033-x

zbMATH Keywords

diameterdense digraphtriple-loop digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Abelian Cayley digraphs with asymptotically large order for any given degree ⋮ The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ On the existence of hyper-L triple-loop networks ⋮ Triple-loop networks with arbitrarily many minimum distance diagrams ⋮ A family of efficient six-regular circulants representable as a Kronecker product

Cites Work

• Unnamed Item
• Double commutative-step digraphs with minimum diameters
• Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem
• Exact order of subsets of asymptotic bases
• Distributed loop network with minimum transmission delay
• Triple loop networks with small transmission delay
• Double loop networks with minimum delay
• An efficient algorithm to find optimal double loop networks
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• Diameters of weighted double loop networks
• Two theorems on matrices
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Extremal Problems in the Construction of Distributed Loop Networks

This page was built for publication: New dense families of triple loop networks