Extremal Problems in the Construction of Distributed Loop Networks

DOI10.1137/S0895480190184811zbMATH Open0799.05033MaRDI QIDQ4287940FDOQ4287940

Authors: D. Frank Hsu, Xing-De Jia 

Publication date: 12 May 1994

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

Recommendations

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

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)

Cited In (18)

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

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)