Extremal Problems in the Construction of Distributed Loop Networks

DOI10.1137/S0895480190184811zbMath0799.05033MaRDI QIDQ4287940

D. Frank Hsu, Xing-De Jia

Publication date: 12 May 1994

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

zbMATH Keywords

diameterCayley digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Additive bases, including sumsets (11B13) Directed graphs (digraphs), tournaments (05C20) Linear Diophantine equations (11D04)

Related Items (15)

A survey on multi-loop networks. ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Triple loop networks with small transmission delay ⋮ A symbolical algorithm on additive basis and double-loop networks ⋮ The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ Extremal Bases for Finite Cyclic Groups ⋮ Exact order of subsets of asymptotic bases ⋮ Extremal bases for finite cyclic groups ⋮ Distributed loop network with minimum transmission delay ⋮ Efficient eight-regular circulants based on the Kronecker product ⋮ Triple-loop networks with arbitrarily many minimum distance diagrams ⋮ Answers to two questions posed by Farhi concerning additive bases ⋮ New dense families of triple loop networks ⋮ Unnamed Item ⋮ A family of efficient six-regular circulants representable as a Kronecker product

This page was built for publication: Extremal Problems in the Construction of Distributed Loop Networks