AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalized exponent for primitive Boolean matrices. In the study of generalized exponents, we focus on problems of the following three types: (1) To determine the maxima (namely, the exact upper bounds) of all kinds of generalized exponents; (2) To characterize the extreme matrices completely; (3) To determine the sets of exponents (including the existence of gaps and their distributions). In this survey we will describe respectively the developments of these problems in recent years
summary:We obtain upper bounds for generalized indices of matrices in the class of nearly reducible ...
AbstractA l-colored digraph D(l) is primitive if there exists a nonnegative integer vector α such th...
AbstractThe index set problem for a class of Boolean (or nonnegative) matrices is a generalization o...
AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalize...
AbstractThe exponent of a primitive digraph is the smallest integer k such that for each ordered pai...
Abstract. A Boolean matrix A is said to be r−regular if each vertex in its digraph G(A) = G has out...
AbstractThe exponent of a primitive digraph is the smallest integer k such that for each ordered pai...
AbstractA strongly connected digraph D of order n is primitive (aperiodic) provided the greatest com...
AbstractLet b=b(A) be the Boolean rank of an n×n primitive Boolean matrix A and exp(A) be the expone...
AbstractWe present a bound on the exponent exp(A) of an n × n primitive matrix A in terms of its boo...
AbstractLet A be a primitive matrix of order n, and let k be an integer with 1⩽k⩽n. The kth local ex...
A set of nonnegative matrices M = {M1, M2, . . . , Mk} is called primitive if there exist indices i1...
AbstractFor a primitive matrix A of order n + k having a primitive submatrix of order n, we prove th...
AbstractLet r,n be integers, −n<r<n, An n×n Boolean matrix A is called r-indecomposable if it contai...
AbstractM. Lewin and Y. Vitek conjecture [7] that every integer ⩽[(n>2−2n+2)2]+1 is an exponent of s...
summary:We obtain upper bounds for generalized indices of matrices in the class of nearly reducible ...
AbstractA l-colored digraph D(l) is primitive if there exists a nonnegative integer vector α such th...
AbstractThe index set problem for a class of Boolean (or nonnegative) matrices is a generalization o...
AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalize...
AbstractThe exponent of a primitive digraph is the smallest integer k such that for each ordered pai...
Abstract. A Boolean matrix A is said to be r−regular if each vertex in its digraph G(A) = G has out...
AbstractThe exponent of a primitive digraph is the smallest integer k such that for each ordered pai...
AbstractA strongly connected digraph D of order n is primitive (aperiodic) provided the greatest com...
AbstractLet b=b(A) be the Boolean rank of an n×n primitive Boolean matrix A and exp(A) be the expone...
AbstractWe present a bound on the exponent exp(A) of an n × n primitive matrix A in terms of its boo...
AbstractLet A be a primitive matrix of order n, and let k be an integer with 1⩽k⩽n. The kth local ex...
A set of nonnegative matrices M = {M1, M2, . . . , Mk} is called primitive if there exist indices i1...
AbstractFor a primitive matrix A of order n + k having a primitive submatrix of order n, we prove th...
AbstractLet r,n be integers, −n<r<n, An n×n Boolean matrix A is called r-indecomposable if it contai...
AbstractM. Lewin and Y. Vitek conjecture [7] that every integer ⩽[(n>2−2n+2)2]+1 is an exponent of s...
summary:We obtain upper bounds for generalized indices of matrices in the class of nearly reducible ...
AbstractA l-colored digraph D(l) is primitive if there exists a nonnegative integer vector α such th...
AbstractThe index set problem for a class of Boolean (or nonnegative) matrices is a generalization o...