nearly reducible matrices

This thesis is devoted to the study of the k -exponent of primitive, nearly reducible matrices. We use graph-theoretic version to relate, use graph-theoretic methods and techniques to prove our results.
本文主要研究本原幾乎可約矩陣的k-頂點指數.我們採用圖論的語言來描述、用圖論的技巧和方法來研究我們的問題。