On the Exponent of a Primitive, Nearly Reducible Matrix. II
Author:
- Jeffrey A. RossJRJeffrey A. Ross
- 1 September 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 3 (3) , 395-410
Abstract
A nonnegative matrix is called nearly reducible provided it is irreducible and the replacement of any positive entry by zero yields a reducible matrix. The purpose of this article is to investigate the exponent $\gamma ( A )$ of an $n \times n$ primitive, nearly reducible matrix A. Our principal result is that $\gamma ( A )\leqq n + s ( n - 3 )$, where s is the length of a shortest circuit in the directed graph associated with A. It is an easy application of this result to find gaps in the exponent set of $n \times n$ primitive, nearly reducible matrices. We also show that for integers n, k satisfying $n\geqq k - 1\geqq 5$ there exists an $n \times n$ primitive, nearly reducible matrix with exponent k. The proofs are carried out by means of directed graphs.
Keywords
This publication has 11 references indexed in Scilit:
- Superfluous paths in strong digraphsDiscrete Mathematics, 1983
- On the Exponent of a Primitive, Nearly Reducible MatrixMathematics of Operations Research, 1980
- A unified treatment of nearly reducible and nearly decomposable matricesLinear Algebra and its Applications, 1979
- NONNEGATIVE MATRICES1979
- Periods of Connected Networks and Powers of Nonnegative MatricesMathematics of Operations Research, 1977
- Bounds for exponents of doubly stochastic primitive matricesMathematische Zeitschrift, 1974
- On exponents of primitive matricesNumerische Mathematik, 1971
- Gaps in the exponent set of primitive matricesIllinois Journal of Mathematics, 1964
- The index of primitivity of a non-negative matrixNumerische Mathematik, 1964
- On powers of non-negative matricesProceedings of the American Mathematical Society, 1958