Double commutative-step digraphs with minimum diameters

DOI10.1016/0012-365X(93)90363-XMaRDI QIDQ685671zbMATHFDO

Authors P. Esqué, Francesc Aguiló, Miquel Angel Fiol

Publication date 24 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphsdiameterlower boundtilescirculant digraphstight digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Combinatorial aspects of tessellation and tiling problems (05B45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Discrete dynamics over double commutative-step digraphs
• Procreating tiles of double commutative-step digraphs
• scientific article; zbMATH DE number 4057538
• scientific article; zbMATH DE number 4128836
• Infinite families of singular \(k\)-tight integers

Cites work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem
• Diameters of weighted double loop networks
• Double loop networks with minimum delay
• Two theorems on matrices

Cited in

(20)

• A simple algorithm to find the steps of double-loop networks
• Classification of numerical 3-semigroups by means of L-shapes.
• An efficient algorithm to find optimal double loop networks
• scientific article; zbMATH DE number 6302970 (Why is no real title available?)
• Abelian Cayley digraphs with asymptotically large order for any given degree
• The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks
• Triple loop networks with small transmission delay
• The dilating method to obtain dense Cayley digraphs on finite abelian groups
• Tessellating polyominos in the plane
• scientific article; zbMATH DE number 4128836 (Why is no real title available?)
• A complementary survey on double-loop networks
• New dense families of triple loop networks
• Designing of optimal double loop networks
• Discrete dynamics over double commutative-step digraphs
• On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant
• Improved upper and lower bounds on the optimization of mixed chordal ring networks
• An efficient algorithm to find a double-loop network that realizes a given L-shape
• A symbolical algorithm on additive basis and double-loop networks
• Procreating tiles of double commutative-step digraphs
• scientific article; zbMATH DE number 4168704 (Why is no real title available?)

This page was built for publication: Double commutative-step digraphs with minimum diameters

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