AbstractWe obtain a lower bound for e(n), the least integer (greater than or equal to 5) that is not the exponent of any nXn primitive, nearly reducible matrix. The main result is that under certain hypotheses about the distance between n and the nearest prime number we have that e(n)>n2⧸3
A primitive digraph D on n vertices has large exponent if its exponent, γ(D), satisfies αn⩽γ(D)⩽wn, ...
AbstractSuppose A is an n × n nonnegative primitive matrix whose minimal polynomial has degree m. We...
AbstractAn n × n nonnegative matrix A is called primitive if for some positive integer k, every entr...
AbstractWe consider n × n primitive nearly reducible matrices for n⩾5. As defined by Ross, let e(n) ...
AbstractFor a primitive, nearly reducible matrix, J.A. Ross defined e(n) to be the least integer gre...
AbstractWe characterize the equality case of the upper bound γ(D) ⪕ n + s(n − 2) for the exponent of...
AbstractA nonnegative matrix M with zero trace is primitive if for some positive integer k, Mk is po...
AbstractA. L. Dulmage and N. S. Mendelsohn proved that bs(n) ⩽ n + s(n − 2), where bs(n) = max {m | ...
A digraph G is called primitive if for some positive integer k, there is a walk of length exactly k ...
AbstractA digraph G = (V, E) is primitive if, for some positive integer k, there is a u → v walk of ...
AbstractLet D=(V,E) be a primitive digraph. The local exponent of D at a vertex u∈V, denoted by expD...
AbstractLet digraph G be a primitive digraph. The parameter l(G) introduced by M. Lewin [Numer. Math...
AbstractLet D=(V,E) be a primitive digraph. The local exponent of D at a vertex u∈V, denoted by γD(u...
Abstract. A Boolean matrix A is said to be r−regular if each vertex in its digraph G(A) = G has out...
AbstractA primitive digraph D on n vertices has large exponent if its exponent, γ(D), satisfies αn⩽γ...
A primitive digraph D on n vertices has large exponent if its exponent, γ(D), satisfies αn⩽γ(D)⩽wn, ...
AbstractSuppose A is an n × n nonnegative primitive matrix whose minimal polynomial has degree m. We...
AbstractAn n × n nonnegative matrix A is called primitive if for some positive integer k, every entr...
AbstractWe consider n × n primitive nearly reducible matrices for n⩾5. As defined by Ross, let e(n) ...
AbstractFor a primitive, nearly reducible matrix, J.A. Ross defined e(n) to be the least integer gre...
AbstractWe characterize the equality case of the upper bound γ(D) ⪕ n + s(n − 2) for the exponent of...
AbstractA nonnegative matrix M with zero trace is primitive if for some positive integer k, Mk is po...
AbstractA. L. Dulmage and N. S. Mendelsohn proved that bs(n) ⩽ n + s(n − 2), where bs(n) = max {m | ...
A digraph G is called primitive if for some positive integer k, there is a walk of length exactly k ...
AbstractA digraph G = (V, E) is primitive if, for some positive integer k, there is a u → v walk of ...
AbstractLet D=(V,E) be a primitive digraph. The local exponent of D at a vertex u∈V, denoted by expD...
AbstractLet digraph G be a primitive digraph. The parameter l(G) introduced by M. Lewin [Numer. Math...
AbstractLet D=(V,E) be a primitive digraph. The local exponent of D at a vertex u∈V, denoted by γD(u...
Abstract. A Boolean matrix A is said to be r−regular if each vertex in its digraph G(A) = G has out...
AbstractA primitive digraph D on n vertices has large exponent if its exponent, γ(D), satisfies αn⩽γ...
A primitive digraph D on n vertices has large exponent if its exponent, γ(D), satisfies αn⩽γ(D)⩽wn, ...
AbstractSuppose A is an n × n nonnegative primitive matrix whose minimal polynomial has degree m. We...
AbstractAn n × n nonnegative matrix A is called primitive if for some positive integer k, every entr...
DOI
Add to ORKG