Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes (Q1129812): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:14, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes |
scientific article |
Statements
Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes (English)
0 references
8 November 1998
0 references
A problem of fault-tolerant routings in fault-tolerant networks is considered. The author generalizes known results for the cube to the hypercube, i.e. the Cartesian product of digraphs \(C_{d_1} \times C_{d_2} \times\cdots \times C_{d_n}\), where \(C_{d_i}\) is a directed cycle of length \(d_i \geq 2\), \(i=1,2, \dots, n\), \(n\geq 1\). He studies some properties of Cartesian products of these digraphs and fault-tolerant routings in the hypercube.
0 references
fault-tolerant routings
0 references
fault-tolerant networks
0 references
digraphs
0 references
hypercube
0 references