The diameter of an orientation of a complete multipartite graph

Abstract For a graph G , let e ( G ) denote the minimum value of the diameters diam D of D , where D runs through all the orientations of G . In this paper, we obtain some results on e ( G ) for complete multipartite graphs G , which extend some known results due to Boesch and Tindell [1] and Maurer [4].