The orientation number of three complete graphs with linkages

Abstract

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 consider the problem of determining the orientation number of three complete graphs with linkages.