A problem on the exponent of primitive digraphs (Q1923217)

Let \(D\) be a finite digraph and let \(A\) denote the connection matrix of \(D\). The exponent of primitivity of \(D\) is defined to be \(\gamma (D) = \min \{k\in N \mid A^k >0\}\) where \(N\) is the set of positive integers. Let us denote by \(m_A\) the degree of the minimal polynomial of \(A\). In a recent paper [Linear Algebra Appl. 216, 185-203 (1995; Zbl 0820.15008)], the author has proved the inequality \(\gamma (D) \leq(m_A- 1)^2+1\) which was conjectured by R. E. Hartwig and M. Neumann. In the paper under review, all digraphs with \(\gamma (D) = (m_A- 1)^2+1\) are characterized.