Strong orientations of complete k-partite graphs achieving the strong diameter
In this paper, we consider each integer d between the lower and upper orientable strong diameter of the complete k-partite graph K(m(1), M(2), ..., m(k)), and show that there does exist a strong orientation of K(m(1), M(2), ..., m(k)) such that sdiam(K) = d. (C) 2009 Elsevier B.V. All rights reserved.
complete k-partite graph strong diameter lower and upper orientable strong diameter automatic theorem proving strong distance