Abstract

For a primitive matrix A of order n + k having a primitive submatrix of order n, we prove that the exponent of A is at most ( n − 1) 2 + 2 k + 1. We characterize those matrices attaining the bound in terms of their directed graphs, and explicitly describe those graphs for the case that k < 2 n.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call