Abstract.
Let f(n) be the minimum number of arcs among oriented graphs of order n and diameter 2. Here it is shown for n>8 that (1−o(1))n log n≤f(n)≤n log n−(3/2)n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: April 12, 1996 / Revised: November 28, 1997
Rights and permissions
About this article
Cite this article
Füredi, Z., Horak, P., Pareek, C. et al. Minimal Oriented Graphs of Diameter 2. Graphs Comb 14, 345–350 (1998). https://doi.org/10.1007/PL00021182
Issue Date:
DOI: https://doi.org/10.1007/PL00021182
- Key words and phrases. Diameter of graphs
- digraphs
- crossintersecting families.
- The research of the first author was supported in part by the Hungarian National Science Foundation under grant OTKA 016389
- and by a National Security Agency grant No. MDA904-95-H-1045. The research of the second author was supported by a Kuwait University grant SM-168.