Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes (Q1129812): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jun-Ming Xu / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ferdinand Gliviak / rank | |||
Property / author | |||
Property / author: Jun-Ming Xu / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ferdinand Gliviak / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11766-998-0039-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2312959533 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3794087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fault-tolerant routings in Kautz and de Bruijn networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with Given Group and Given Graph-Theoretical Properties / rank | |||
Normal rank |
Latest revision as of 16:00, 28 May 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