Minimal oriented graphs of diameter 2 (Q1272532)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimal oriented graphs of diameter 2 |
scientific article; zbMATH DE number 1234338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal oriented graphs of diameter 2 |
scientific article; zbMATH DE number 1234338 |
Statements
Minimal oriented graphs of diameter 2 (English)
0 references
2 August 1999
0 references
Let \(f(n)\) be the minimum number of arcs among oriented graphs of order \(n\) and diameter 2. The authors show that \((1-o(1))n\log n\leq f(n)\leq n\log n-(3/2)n\) for \(n>8\).
0 references
oriented graphs
0 references
diameter
0 references
