On the matrix sequence for a Boolean matrix whose digraph is linearly connected
arXiv:1307.3881
Abstract
In this paper, we extend the results given by Park {\em et al.} \cite{ppk} by studying the convergence of the matrix sequence for a matrix the digraph of which is linearly connected with an arbitrary number of strong components. In the process for generalization, we concretize ideas behind their arguments. We completely characterize for which converges. Then we find its limit when all of the irreducible diagonal blocks are of order at least two. We go further to characterize for which the limit of is a block diagonal matrix. All of these results are derived by studying the -step competition graph of the digraph of .
19 pages, 4 figures