Diameter of orientations of graphs with given order and number of blocks

P. Dankelmann, M. J. Morgan, E. J. Rivett-Carnac

A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is strongly connected. The oriented diameter of $G$ is the smallest diameter among al…