𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Basic Structures of Some Interconnection Networks

✍ Scribed by Eddie Cheng; Marc J. Lipman

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
855 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Matching preclusion for some interconnec
Matching preclusion for some interconnection networks
✍ Eddie Cheng; LΓ‘szlΓ³ LiptΓ‘k πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 253 KB

## Abstract The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost‐perfect matchings. In this paper, we find this number for various classes of interconnection networks and classify all the optimal sol

Strategies for interconnection networks:
Strategies for interconnection networks: Some methods from graph theory
✍ J.-C. Bermond; C. Delorme; J.-J. Quisquater πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 909 KB

Interconnection networks require dense graphs in the sense that many nodes with relatively few links may be connected with relatively short paths. Some recent constructions of such dense graphs with a given maximal degree A and diameter D (known as (A, D) graphs) are reviewed here. The paper also co