On the matrix sequence \(Am)\m=1∞ for a Boolean matrix A whose digraph is linearly connected
Abstract
In this paper, we extend the results given by Park et al. ppk by studying the convergence of the matrix sequence \(Am)\m=1∞ for a matrix A ∈ Bn 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 A for which \(Am)\m=1∞ converges. Then we find its limit when all of the irreducible diagonal blocks are of order at least two. We go further to characterize A for which the limit of \(Am)\m=1∞ is a J block diagonal matrix. All of these results are derived by studying the m-step competition graph of the digraph of A.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.