Optimal orientations of products of paths and cycles (Q1377664)

For a graph \(G\), let \(d_0(G)\) be the minimum diameter of a strong orientation of \(G\). The authors consider \(\rho(G)= d_0(G)- d(G)\), where \(d(G)\) is the diameter of \(G\). It is shown that \(\rho(G)= 0\) if \(G\) is a Cartesian product of (1) paths, and (2) paths and cycles, which satisfy some mild conditions.