Topology Notes
Graph Theory Ch. 4. Connectivity and paths 1 Chapter 4 Connectivity and Paths.
2.4 Irreducible Matrices
2.4 Irreducible Matrices. Reducible is reducible if there is a permutation P such that where A 11 and A 22 are square matrices each of size at least one;