Triple-loop networks with arbitrarily many minimum distance diagrams

DOI10.1016/J.DISC.2008.02.047MaRDI QIDQ1024484zbMATHOpenAlexFDO

Authors Pilar Sabariego, Francisco Santos

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

digraphscirculant graphsinitial idealmulti-loop network

Mathematics Subject Classification ID

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

Abstract: Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a very definite form "L-shape. In contrast, in this paper we show that there are triple-loop networks with an arbitrarily big number of associated minimum distance diagrams. For doing this, we build-up on the relations between minimum distance diagrams and monomial ideals.

Recommendations

• Triple loop networks with small transmission delay
• A simple algorithm to find the steps of double-loop networks
• scientific article; zbMATH DE number 2192178
• Triple Loop Networks with Minimal Transmission Delay
• New dense families of triple loop networks

Cites work

• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• A complementary survey on double-loop networks
• A survey on multi-loop networks.
• An efficient algorithm to find optimal double loop networks
• Diameters of weighted double loop networks
• Extremal Problems in the Construction of Distributed Loop Networks
• Gröbner bases of lattices, corner polyhedra, and integer programming
• New dense families of triple loop networks
• On the existence of hyper-L triple-loop networks
• The existence of hyper-L triple-loop networks.
• Triple loop networks with small transmission delay

Cited in

(11)

• On the existence of hyper-L triple-loop networks
• Computer Algebra in Scientific Computing
• On the number of L-shapes in embedding dimension four numerical semigroups
• On the page number of triple-loop networks with even cardinality.
• An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup.
• Generalized 3-(edge)-connectivity for undirected double-loop networks
• Connectedness of finite distance graphs
• Reaching fault diagnosis agreement under a hybrid fault model
• Large chordal rings for given diameter and uniqueness property of minima.
• The dilating method to obtain dense Cayley digraphs on finite abelian groups
• New dense families of triple loop networks

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

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