THE ORIENTATION NUMBER OF THREE COMPLETE GRAPHS WITH LINKAGES

THE ORIENTATION NUMBER OF THREE COMPLETE GRAPHS WITH LINKAGES

G. Rajasekaran, R. Sampathkumar

[PDF]

Abstract

For a graph G, let D(G) be the set of all strong orientations of G. The orien- tation 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.

Keywords

complete graphs, orientation number