𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Weighted multi-connected loop networks

✍ Scribed by Öystein J. Rödseth

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
487 KB
Volume
148
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Given relatively prime integers N,a~,...,ak, a multi-connected loop network is defined as the directed graph with vertex set Z/NZ = {0, 1 ..... N -1}, and directed edges i ~ r :-i+ aj (mod N). If each edge i ---, i+ aJ is given a positive real weight wj for j = 1 ..... k, then we have a weighted multi-connected loop network. The weight of a path is the sum of weights on its edges. The distance from a vertex to another is the minimum weight of all paths from the first vertex to the second. The diameter of the network is the maximum distance, and the average diameter is the average distance in the network. In this paper we study the diameter and the average diameter of a weighted multi-connected loop network. We give a unified and generalized presentation of several results in the literature, and also some new results are obtained.

📜 SIMILAR VOLUMES

Generalized multi-stage connection netwo
Generalized multi-stage connection networks
✍ G. M. Masson; B. W. Jordan Jr. 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 954 KB

This paper develops multi-stage connection networks i n which each input terminaZ can be connected t o any number o f output terminals. strict29 nonblocking or are rearrangeable. rithms and upper bounds on the required number of moves are deveZoped and it is shown that such netuorks have fewer cross

Embedding connected double-loop networks
Embedding connected double-loop networks with even cardinality in books
✍ Weihua Yang; Jixiang Meng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 391 KB

A book-embedding of a graph G comprises embedding the graphs nodes along the spine of a book and embedding the edges on the pages so that there is no crossing of arcs on each page. In this paper, we propose schemes to embed the connected double-loop networks with even cardinality in books.