- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnlilne Submission ㆍMy Manuscript - For Reviewers - For Editors
 Competition indices of strongly connected digraphs Bull. Korean Math. Soc. 2011 Vol. 48, No. 3, 637-646 https://doi.org/10.4134/BKMS.2011.48.3.637Published online May 1, 2011 Han Hyuk Cho and Hwa Kyung Kim Seoul National University, Sangmyung University Abstract : 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. Keywords : competition graph, $m$-step competition graph, competition index, competition period, scrambling index, symmetric digraph MSC numbers : 05C20, 05C50 Full-Text :