Extremal Problems in the Construction of Distributed Loop Networks

DOI10.1137/S0895480190184811MaRDI QIDQ4287940zbMATHFDO

Authors 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

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

Recommendations

• Extremal Cayley Digraphs of Finite Cyclic Groups
• Undirected loop networks
• scientific article; zbMATH DE number 828048

Cited in

(18)

• scientific article; zbMATH DE number 7310081 (Why is no real title available?)
• On the diameter of undirected Cayley graphs of finite abelian groups
• Triple-loop networks with arbitrarily many minimum distance diagrams
• Recursive construction of parallel distribution networks
• Exact order of subsets of asymptotic bases
• Answers to two questions posed by Farhi concerning additive bases
• Extremal bases for finite cyclic groups
• A survey on undirected circulant graphs
• A survey on multi-loop networks.
• Triple loop networks with small transmission delay
• The dilating method to obtain dense Cayley digraphs on finite abelian groups
• scientific article; zbMATH DE number 828048 (Why is no real title available?)
• New dense families of triple loop networks
• A family of efficient six-regular circulants representable as a Kronecker product
• Efficient eight-regular circulants based on the Kronecker product
• Distributed loop network with minimum transmission delay
• Extremal bases for finite cyclic groups
• A symbolical algorithm on additive basis and double-loop networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287940)