Triple-loop networks with arbitrarily many minimum distance diagrams

DOI10.1016/J.DISC.2008.02.047zbMATH Open1188.05150arXiv0705.3631OpenAlexW2093633756MaRDI QIDQ1024484FDOQ1024484

Authors: Pilar Sabariego, Francisco Santos 

Publication date: 17 June 2009

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

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.

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

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

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)

Cites Work

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

Cited In (11)

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