On the oriented diameter of graphs with given minimum degree
On the oriented diameter of graphs with given minimum degree
Erd\H{o}s, Pach, Pollack, and Tuza [J. Combin. Theory Ser. B, 47(1) (1989), 73--79] proved that the diameter of a connected $n$-vertex graph with minimum degree $\delta$ is at most $\frac{3n}{\delta+1}+O(1)$. The oriented diameter of an undirected graph $G$, denoted by $\overrightarrow{diam}(G)$, is the minimum diameter of a strongly connected orientation …