JOURNAL BROWSE
Search
Advanced SearchSearch Tips
COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS
Cho, Han-Hyuk; Kim, Hwa-Kyung;
  PDF(new window)
 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;
 Language
English
 Cited by
1.
THE COMPETITION INDEX OF A NEARLY REDUCIBLE BOOLEAN MATRIX,;;

대한수학회보, 2013. vol.50. 6, pp.2001-2011 crossref(new window)
1.
On Some Recent Developments in Ulam's Type Stability, Abstract and Applied Analysis, 2012, 2012, 1  crossref(new windwow)
2.
A matrix sequence{Γ(Am)}m=1∞might converge even if the matrix A is not primitive, Linear Algebra and its Applications, 2013, 438, 5, 2306  crossref(new windwow)
3.
A bound on the generalized competition index of a primitive matrix using Boolean rank, Linear Algebra and its Applications, 2011, 435, 9, 2166  crossref(new windwow)
4.
Characterization of irreducible Boolean matrices with the largest generalized competition index, Linear Algebra and its Applications, 2015, 466, 218  crossref(new windwow)
5.
THE COMPETITION INDEX OF A NEARLY REDUCIBLE BOOLEAN MATRIX, Bulletin of the Korean Mathematical Society, 2013, 50, 6, 2001  crossref(new windwow)
6.
Generalized competition index of an irreducible Boolean matrix, Linear Algebra and its Applications, 2013, 438, 6, 2747  crossref(new windwow)
7.
Scrambling index set of primitive digraphs, Linear Algebra and its Applications, 2013, 439, 7, 1886  crossref(new windwow)
8.
On the matrix sequence for a Boolean matrix A whose digraph is linearly connected, Linear Algebra and its Applications, 2014, 450, 56  crossref(new windwow)
9.
Generalized competition indices of symmetric primitive digraphs, Discrete Applied Mathematics, 2012, 160, 10-11, 1583  crossref(new windwow)
10.
A bound of generalized competition index of a primitive digraph, Linear Algebra and its Applications, 2012, 436, 1, 86  crossref(new windwow)
 References
1.
M. Akelbek and S. Kirkland, Coefficients of ergodicity and the scrambling index, Linear Algebra Appl. 430 (2009), no. 4, 1111-1130. crossref(new window)

2.
R. A. Brualdi and H. J. Ryser, Combinatorial Matrix Theory, Cambridge University Press, 1991.

3.
H. H. Cho, Indices of irreducible Boolean matrix, J. Korean Math. Soc. 30 (1993), no. 2, 267-274.

4.
H. H. Cho and H. K. Kim, Competition indices of digraphs, Proceedings of workshop in combinatorics (2004), 99-107.

5.
H. H. Cho, S.-R. Kim, and Y. Nam, The m-step competition graph of a digraph, Discrete Appl. Math. 105 (2000), no. 1-3, 115-127. crossref(new window)

6.
H. K. Kim, Competition indices of tournaments, Bull. Korean Math. Soc. 45 (2008), no. 2, 385-396. crossref(new window)

7.
B. Liu and H.-J. Lai, Matrices in Combinatorics and Graph Theory, Kluwer Academic Publishers, 2000.

8.
J. Shao, The exponent set of symmetric primitive matrices, Scientia Sinica Ser. A 30 (1987), no. 4, 348-358.

9.
J. Shao and Q. Li, The indices of convergence reducible Boolean matrices, Acta Math. Sinica 33 (1990), 13-28.

10.
J. Shen, Proof of a conjecture about the exponent of primitive matrics, Linear Algebra and Its Appl. 216 (1995), 185-203. crossref(new window)