Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the matrix sequence $\{Γ(A^m)\}_{m=1}^\infty$ for a Boolean matrix $A$ whose digraph is linearly connected

Published 15 Jul 2013 in math.CO | (1307.3881v1)

Abstract: In this paper, we extend the results given by Park {\em et al.} \cite{ppk} by studying the convergence of the matrix sequence ${\Gamma(Am)}_{m=1}\infty$ for a matrix $A \in \mathcal{B}n$ 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 ${\Gamma(Am)}{m=1}\infty$ 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 ${\Gamma(Am)}_{m=1}\infty$ is a $J$ block diagonal matrix. All of these results are derived by studying the $m$-step competition graph of the digraph of $A$.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.