COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS

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 Kirkland [1] also studied the upper bound of competition indices of primitive digraphs. In this paper, we study the upper bound of competition indices of strongly connected digra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Taehan Suhakhoe hoebo 2011, Vol.48 (3), p.637-646
Hauptverfasser: Cho, Han-Hyuk, Kim, Hwa-Kyung
Format: Artikel
Sprache:kor
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Cho and Kim [4] and Kim [6] introduced the concept of the competition index of a digraph. Cho and Kim [4] and Akelbek and Kirkland [1] also studied the upper bound of competition indices of primitive digraphs. In this paper, we study the upper bound of competition indices of strongly connected digraphs. We also study the relation between competition index and ordinary index for a symmetric strongly connected digraph.
ISSN:1015-8634