Optimal orientations of products of paths and cycles Original Research Article

For a graph G, let D(G) be the family of strong orientations of G, d(G) = min{d(D)∣D ∈ D (G)} and p(G) = d(G) − d(G), where d(G) and d(D) are the diameters of G and D respectively. In this paper we show that p(G) = 0 if G is a cartesian product of