Triple-loop networks with arbitrarily many minimum distance diagrams

DOI10.1016/j.disc.2008.02.047zbMath1188.05150arXiv0705.3631OpenAlexW2093633756MaRDI QIDQ1024484

Francisco Santos, Pilar Sabariego

Publication date: 17 June 2009

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

Full work available at URL: https://arxiv.org/abs/0705.3631

zbMATH Keywords

digraphsinitial idealcirculant graphsmulti-loop network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)

Related Items (4)

An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup. ⋮ The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ Connectedness of finite distance graphs ⋮ On the number of L-shapes in embedding dimension four numerical semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• New dense families of triple loop networks
• Triple loop networks with small transmission delay
• The existence of hyper-L triple-loop networks.
• An efficient algorithm to find optimal double loop networks
• A survey on multi-loop networks.
• Gröbner bases of lattices, corner polyhedra, and integer programming
• On the existence of hyper-L triple-loop networks
• Diameters of weighted double loop networks
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Extremal Problems in the Construction of Distributed Loop Networks
• A complementary survey on double-loop networks

This page was built for publication: Triple-loop networks with arbitrarily many minimum distance diagrams