The Boolean pivot operation, \(M\)-matrices, and reducible matrices (Q2365720)

The concept of Boolean pivot operation is introduced and its properties are investigated. Some criteria for irreducibility of Boolean block matrices and necessary condition for reducibility of a Boolean (or real) matrix are derived, with the aid of Boolean pivot operations. A condensed form of Wallshall's algorithm for testing whether a Boolean matrix is irreducible is given. A close connection between Boolean matrices and \(M\)-matrices is established: they have the same zero pattern before and after pivoting. A flexible algorithm for excluding and including vertices in a digraph while retaining the original connection between the vertices of the current digraph is given. Finally, two results by \textit{R. L. Smith} [Linear Algebra Appl. 106, 219-231 (1988; Zbl 0652.15017)] on irreducibility of real block matrices are corrected.