Orientable Strong Radius and Diameter of Hypercube

For two vertices u, v in a strong digraph D, the strong distance sd(u, v) between u and v is the minimum size of a strong subdigraph of D containing u and v. The upper (lower) orientable strong radius SRAD(G) of a graph G is the maximum (minimum) strong radius over all strong orientations of G. The upper (lower) orientable strong diameter SDIAM(G) of a graph G is the maximum (minimum) strong diameter over all strong orientations of G. This paper provides the lower orientable strong radius and diameter of a d-dimensional hypercube, the lower bound of the upper orientable strong radius of a d-dimensional hypercube, and the upper orientable strong diameter of a d-dimensional hypercube for d≤4.