Abstract
A nonnegative matrix M with zero trace is primitive if for some positive integer k, M k is positive. The exponent exp( M) of the primitive matrix is the smallest such k. By treating the digraph G whose adjacency matrix is the primitive matrix M, we will show that the minimum number of positive entries of M is 3 n − 3 when exp( M) = 2. We will also show that for a symmetric n × n matrix M if exp( M) = 2, the minimum number of positive entries of M is 3 n − 2 or 3 n − 3 according to n.
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 callDisclaimer: 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.
