Minimal oriented graphs of diameter 2 (Q1272532): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:56, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal oriented graphs of diameter 2 |
scientific article |
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
