Optimal Orientations of Some Complete Tripartite Graphs

G Rajasekaran, R Sampathkumar

Abstract


For a graph G, let D(G) be the set of all strong orientations of G.
The orientation number of G is  min {d(D)|D belongs to 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.


Full Text:

PDF

Refbacks

  • There are currently no refbacks.