Bull. Korean Math. Soc. 2011; 48(3): 637-646
Printed May 1, 2011
https://doi.org/10.4134/BKMS.2011.48.3.637
Copyright © The Korean Mathematical Society.
Han Hyuk Cho and Hwa Kyung Kim
Seoul National University, Sangmyung University
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
2013; 50(6): 2001-2011
2008; 45(2): 385-396
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd