COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS

DOI10.4134/BKMS.2011.48.3.637zbMath1220.05047OpenAlexW1972857319MaRDI QIDQ3008182

Hwa Kyung Kim, Han Hyuk Cho

Publication date: 14 June 2011

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://www.mathnet.or.kr/mathnet/kms_content.php?no=406078

zbMATH Keywords

symmetric digraphcompetition graphscrambling indexcompetition index\(m\)-step competition graphcompetition period

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

On \(m\)-step competition graphs of bipartite tournaments ⋮ Generalized competition index of an irreducible Boolean matrix ⋮ A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive ⋮ Matrix periods and competition periods of Boolean Toeplitz matrices ⋮ Generalized competition indices of symmetric primitive digraphs ⋮ Scrambling index set of primitive digraphs ⋮ A bound of generalized competition index of a primitive digraph ⋮ On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected ⋮ Characterization of irreducible Boolean matrices with the largest generalized competition index ⋮ A bound on the generalized competition index of a primitive matrix using Boolean rank

This page was built for publication: COMPETITION INDICES OF STRONGLY CONNECTED DIGRAPHS