Optimal orientations of some complete tripartite graphs
G. Rajasekaran, R. Sampathkumar · Filomat · 2015
For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is d?(G) = min{d(D)|D ? D(G)},where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some complete tripartite graphs.