Highly Influenced

@inproceedings{Lai2003OrientableSR, title={Orientable Strong Radius and Diameter of Hypercube}, author={Yung-Ling Lai and Jen-Hao Hsiao and F E Chiang}, year={2003} }

- Published 2003

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… CONTINUE READING