Competition indices of strongly connected digraphs
0
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
Cho and Kim [4] and Kim \cite[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.
Abstract
Cho and Kim [4] and Kim \cite[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.
참고문헌 (10)
- M. Akelbek, "Coefficients of ergodicity and the scrambling index", Linear Algebra Appl, 430(4), pp.1111~1130 (2009)
- R. A. Brualdi, "Combinatorial Matrix Theory" (1991), Cambridge University Press
- H. H. Cho, "Indices of irreducible Boolean matrix", J. Korean Math. Soc, 30(2), pp.267~274 (1993)
- H. H. Cho, "Competition indices of digraphs", Proceedings of workshop in combinatorics, pp.99~107 (2004)
- H. H. Cho, "The m-step competition graph of a digraph", Discrete Appl. Math, 105(1), pp.115~127 (2000)
- 김화경, "Competition indices of tournaments", 대한수학회보, 45(2), pp.385~396 (2008), 대한수학회
- B. Liu, "Matrices in Combinatorics and Graph Theory" (2000), Kluwer Academic Publishers
- J. Shao, "The exponent set of symmetric primitive matrices", Scientia Sinica Ser. A, 30(4), pp.348~358 (1987)
- J. Shao, "The indices of convergence reducible Boolean matrices", Acta Math. Sinica, 33, pp.13~28 (1990)
- J. Shen, "Proof of a conjecture about the exponent of primitive matrics", Linear Algebra and Its Appl, 216, pp.185~203 (1995)