Generalized index of Boolean matrices. (Q2715991)

Let \(A\) be a Boolean matrix of order \(n\) and \(D\) be the associated directed graph with \(A\) as the adjacency matrix. Denote \(p\) the greatest common divisor of lengths of directed circuits in \(D\). The central notion is an ordered sequence of local indices of convergence \((k_D(i))_{i=1}^n\). The number \(k_D(i)\) is the minimum \(m\) such that for every vertex \(j\) of \(D\) there exists a directed walk of length \(m\) from \(i\) to \(j\) if and only if there exists such a walk of length \(m+p\).NEWLINENEWLINEThe maximum values of \(k_D(i)\) are obtained for reducible, irreducible and symmetric matrices by both algebraic and graph-theoretic arguments.