Double commutative-step digraphs with minimum diameters
From MaRDI portal
Publication:685671
DOI10.1016/0012-365X(93)90363-XzbMath0783.05053MaRDI QIDQ685671
P. Esqué, Miquel Àngel Fiol, Francesc Aguiló
Publication date: 24 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of tessellation and tiling problems (05B45) Directed graphs (digraphs), tournaments (05C20)
Related Items (16)
A simple algorithm to find the steps of double-loop networks ⋮ Abelian Cayley digraphs with asymptotically large order for any given degree ⋮ On congruence in \(\mathbb{Z}^ n\) and the dimension of a multidimensional circulant ⋮ Triple loop networks with small transmission delay ⋮ A symbolical algorithm on additive basis and double-loop networks ⋮ The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ The construction of infinite families of any \(k\)-tight optimal and singular \(k\)-tight optimal directed double loop networks ⋮ Procreating tiles of double commutative-step digraphs ⋮ A complementary survey on double-loop networks ⋮ Tessellating polyominos in the plane ⋮ An efficient algorithm to find a double-loop network that realizes a given L-shape ⋮ Improved upper and lower bounds on the optimization of mixed chordal ring networks ⋮ Classification of numerical 3-semigroups by means of L-shapes. ⋮ New dense families of triple loop networks ⋮ An efficient algorithm to find optimal double loop networks ⋮ Designing of optimal double loop networks
Cites Work
This page was built for publication: Double commutative-step digraphs with minimum diameters
