AbstractThe index set problem for a class of Boolean (or nonnegative) matrices is a generalization of the exponent set problem for n × n primitive matrices. We survey the recent advances on the index set problem for various classes of Boolean matrices. Some related research problems are suggested
AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalize...
AbstractWe give a necessary and sufficient condition for an n×n (0,1) matrix (or more generally, an ...
AbstractThe scrambling index of an n×n primitive matrix A is the smallest positive integer k such th...
AbstractThe index set problem for a class of Boolean (or nonnegative) matrices is a generalization o...
AbstractWe obtain explicit formulas for the index set Rn of the class of n × n reducible boolean mat...
AbstractFirst we give a new proof of the sharp upper bound for the indices of convergence of n x n i...
AbstractLet X be a set of k×k matrices in which each element is nonnegative. For a positive integer ...
The adjacency matrix A of a graph G is a 0-1 matrix. The Boolean power sequence of A is convergent o...
AbstractIn this paper we characterize the subsemigroup of Bn (Bn is the multiplicative semigroup of ...
summary:We obtain upper bounds for generalized indices of matrices in the class of nearly reducible ...
AbstractThe index of maximum density of a Boolean (or nonnegative) matrix A is defined as the least ...
AbstractA nonnegative sign pattern matrix is a matrix whose entries are from the set {+,0}. A nonneg...
Abstract. Cho and Kim [4] have introduced the concept of the compe-tition index of a digraph. Simila...
AbstractWe present a bound on the exponent exp(A) of an n × n primitive matrix A in terms of its boo...
A set of nonnegative matrices M = {M1, M2,⋯, Mk} is called primitive if there exist possibly equal i...
AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalize...
AbstractWe give a necessary and sufficient condition for an n×n (0,1) matrix (or more generally, an ...
AbstractThe scrambling index of an n×n primitive matrix A is the smallest positive integer k such th...
AbstractThe index set problem for a class of Boolean (or nonnegative) matrices is a generalization o...
AbstractWe obtain explicit formulas for the index set Rn of the class of n × n reducible boolean mat...
AbstractFirst we give a new proof of the sharp upper bound for the indices of convergence of n x n i...
AbstractLet X be a set of k×k matrices in which each element is nonnegative. For a positive integer ...
The adjacency matrix A of a graph G is a 0-1 matrix. The Boolean power sequence of A is convergent o...
AbstractIn this paper we characterize the subsemigroup of Bn (Bn is the multiplicative semigroup of ...
summary:We obtain upper bounds for generalized indices of matrices in the class of nearly reducible ...
AbstractThe index of maximum density of a Boolean (or nonnegative) matrix A is defined as the least ...
AbstractA nonnegative sign pattern matrix is a matrix whose entries are from the set {+,0}. A nonneg...
Abstract. Cho and Kim [4] have introduced the concept of the compe-tition index of a digraph. Simila...
AbstractWe present a bound on the exponent exp(A) of an n × n primitive matrix A in terms of its boo...
A set of nonnegative matrices M = {M1, M2,⋯, Mk} is called primitive if there exist possibly equal i...
AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalize...
AbstractWe give a necessary and sufficient condition for an n×n (0,1) matrix (or more generally, an ...
AbstractThe scrambling index of an n×n primitive matrix A is the smallest positive integer k such th...
DOI
Add to ORKG