A bound on the exponent of a primitive matrix using Boolean rank
The authors prove that the exponent (also called index of primitivity) of a Boolean matrix of Boolean rank (also called Schein rank) \(b\) is at most \((b- 1)^ 2+ 2\), and that this bound can be attained for all dimensions \(n\) greater than \(b\).
scientific article; zbMATH DE number 754000
scientific article