A new method for constructing infinite families of k-tight optimal double loop networks

DOI10.1007/S11425-006-0525-7zbMATH Open1109.68004OpenAlexW2127410034MaRDI QIDQ862697FDOQ862697

Authors: Xiebin Chen 

Publication date: 24 January 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-006-0525-7

Recommendations

• On infinite families of tight optimal double loop networks
• The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks
• On construction of infinite families of \(k\)-tight optimal double-loop networks
• The construction of infinite families of \(k\)-tight optimal double loop networks
• Infinite Families of Optimal Double-Loop Networks

zbMATH Keywords

diameterinterconnection networkdouble loop networkcirculant digraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cites Work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• Designing of optimal double loop networks
• An infinite family of 4-tight optimal double loop networks
• A complementary survey on double-loop networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A very short proof of a conjecture concerning set‐to‐set broadcasting

Cited In (6)

• Title not available (Why is that?)
• The construction of infinite families of \(k\)-tight optimal double loop networks
• The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks
• On infinite families of tight optimal double loop networks
• Title not available (Why is that?)
• On construction of infinite families of \(k\)-tight optimal double-loop networks

This page was built for publication: A new method for constructing infinite families of \(k\)-tight optimal double loop networks

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