Weighted multi-connected loop networks
From MaRDI portal
Publication:1910548
DOI10.1016/0012-365X(94)00239-FzbMath0842.05039OpenAlexW2002956914MaRDI QIDQ1910548
Publication date: 24 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00239-f
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (9)
Abelian Cayley digraphs with asymptotically large order for any given degree ⋮ Denumerants of 3-numerical semigroups ⋮ The Dilating Method for Cayley digraphs on finite Abelian groups ⋮ Diameters of random circulant graphs ⋮ A complementary survey on double-loop networks ⋮ Improved upper and lower bounds on the optimization of mixed chordal ring networks ⋮ On the number of L-shapes in embedding dimension four numerical semigroups ⋮ Classification of numerical 3-semigroups by means of L-shapes. ⋮ Geometric proof of Rødseth's formula for Frobenius numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius
- Double loop networks with minimum delay
- Über die Lösungszahl einer linearen, diophantischen Ungleichung
- An upper bound for the h-range of the postage stamp problem
- Solution to a linear diophantine equation for nonnegative integers
- Diameters of weighted double loop networks
- Two remarks on linear forms in non-negative integers.
- On the linear diophantine problem of Frobenius.
- A Combinatorial Problem Related to Multimodule Memory Organizations
- On a linear Diophantine problem of Frobenius.
- On a linear Diophantine problem of Frobenius. II.
- The Organization of High-Speed Memory for Parallel Block Transfer of Data
- On a linear diophantine problem of Frobenius
- The Lattice Points of Tetrahedra
- The lattice points of an \(n\)-dimensional tetrahedron
This page was built for publication: Weighted multi-connected loop networks
