Let Г(A) be a directed graph of the matrix A of order n. We say that A is weakly irreducible, if every vertex of Г(A) belongs to some circuit of Г(A). A matrix is weakly irreducible iff there exists a permutation m...Let Г(A) be a directed graph of the matrix A of order n. We say that A is weakly irreducible, if every vertex of Г(A) belongs to some circuit of Г(A). A matrix is weakly irreducible iff there exists a permutation matrix P of order n such展开更多
文摘Let Г(A) be a directed graph of the matrix A of order n. We say that A is weakly irreducible, if every vertex of Г(A) belongs to some circuit of Г(A). A matrix is weakly irreducible iff there exists a permutation matrix P of order n such
