Minimal Diameter Orientation of Complete Split Graph

Diameter of an undirected graph is the maximal distance between any two vertices. We can obtain a digraph (directed graph) by presenting a direction for each edge of the undirected graph. The diameter of a digraph is a nonegative integer d, such that the distance of any two vertices which are strongly connected is at most d. Or else, the diameter is infinite. In this paper we discuss minimal diameter orientation of special graph-complete split graph. Combining the theory of multipartite graph and the property of complete split graph we can obtain what kind of split graph can be 2-diameter oriented.