On the Day-Tripathi orientation of the star graphs: Connectivity
Day and Tripathi (1993) proposed an assignment of directions on the star graphs and derived attractive properties for the resulting directed graphs. An important property is that they are strongly connected. In this short paper, we show that the Day-Tripathi orientations are in fact maximally are-connected when n is odd. For n is even, they can be augmented to maximally arc-connected digraphs by adding a minimum set of arcs. (C) 2000 Elsevier Science B.V. All rights reserved.
connectivity interconnection networks