Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4160761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter |
scientific article; zbMATH DE number 4160761 |
Statements
Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (English)
0 references
1990
0 references
The diameter of any d-regular digraph with n nodes in at least \(\lceil \log_ d(n(d-1)+1)\rceil -1.\) If \(d\geq 3\) and \(n>d^ 3\) the authors construct a d-regular, d-connected digraph with n nodes and diameter at most \(\lceil \log_ dn\rceil\).
0 references
d-regular digraph
0 references
d-connected digraph
0 references
0.9448162913322448
0 references
0.9439694881439208
0 references
0.8689268231391907
0 references
