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 .
Sign-in/Register to access full text options 
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 callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
