On the exponent of a primitive matrix containing a primitive submatrix

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 + 2k + 1. We characterize those matrices attaining the bound in terms of their directed graphs, and explicitly describe those graphs for the case that k < 2n.