For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number d (G) of G is defined by → d (G)=min{d(D) |D ∈ D(G)}. In this paper, we study the orientation numbers of a family of graphs, denoted by G(p, q;m), that are obtained from the disjoint union of two complete graphs Kp a...