On connectivity of consecutive-\(d\) digraphs (Q1850019): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: D. Frank Hsu / rank | |||
| Property / author | |||
| Property / author: Hung Quang Ngo / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ferdinand Gliviak / rank | |||
| Property / author | |||
| Property / author: D. Frank Hsu / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Hung Quang Ngo / 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 | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On connectivity of consecutive-\(d\) digraphs |
scientific article |
Statements
On connectivity of consecutive-\(d\) digraphs (English)
0 references
2 December 2002
0 references
The authors continue the study of consecutive-\(d\) digraphs \(G(d,n,q,r)\), where \(d\), \(n\), \(q\), \(r\) are integers satisfying \(0< d\leq n\), \(-n/2< q\leq n/2\) and \(q\neq 0\). They give strong results concerning the connectivity of these graphs and study the problem of finding good candidates for the topological structure of communication networks.
0 references
communication networks
0 references
