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(m1,m2,…,mk), and show that there does exist a strong orientation of K(m1,m2,…,mk) such that sdiam(K)=d.