COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS

Cho and Kim (4) and Kim (6) introduced the concept of the competition index of a digraph. Cho and Kim (4) and Akelbek and Kirk- land (1) also studied the upper bound of competition indices of primitive digraphs. In this paper, we study the upper bound of competition in- dices of strongly connected digraphs. We also study the relation between competition index and ordinary index for a symmetric strongly connected digraph.