We consider the problem of determining an orientation with minimum diameter MOD(G) of a connected and bridge-less graph G. In 2001 Fomin et al. discovered the relation MOD(G) <= 9 gamma(G) - 5 between the minimum oriented diameter and the size gamma(G) of a minimum dominating set. We improve their upper bound to MOD(G) <= 4 gamma(G).
Debajyoti Mondal;N. Parthiban;Indra Rajasingh, Lecture notes in computer science, Bounds for the Oriented Diameter of Planar Triangulations, pp. 192-205, 2022, 10.1007/978-3-031-20796-9_14.