AbstractLet f0 be the greatest common divisor of the distinct lengths of the elementary cycles of the associated digraph D(A) for a reducible boolean matrix A (f0 is called the generalized period of A). First we give a proof of the sharp bound for the indices of convergence of n × n reducible boolean matrices with the generalized period f0 ⩾ 2. Then we characterize the matrices with the largest index. The proofs are carried out by means of directed graphs
AbstractLet A be a k×k matrix over a ring R; let GM(A,R) be the digraph with vertex set Rk, and an a...
AbstractFor a positive integer m where 1⩽m⩽n, the m-competition index (generalized competition index...
The notions introduced in Braker and Resing (1992), concerning periodicity of 2×2 matrices in a gene...
AbstractFirst we give a new proof of the sharp upper bound for the indices of convergence of n x n i...
summary:We obtain upper bounds for generalized indices of matrices in the class of nearly reducible ...
AbstractWe obtain explicit formulas for the index set Rn of the class of n × n reducible boolean mat...
AbstractLet IBM(n, p) denote the set of all n × n irreducible Boolean matrices with period p. This p...
AbstractWe study sequences of optimal walks of a growing length in weighted digraphs, or equivalentl...
Abstract. Cho and Kim [4] have introduced the concept of the compe-tition index of a digraph. Simila...
The adjacency matrix A of a graph G is a 0-1 matrix. The Boolean power sequence of A is convergent o...
AbstractThe index of maximum density of a Boolean (or nonnegative) matrix A is defined as the least ...
AbstractInclines are the additively idempotent semirings in which products are less than or equal to...
AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalize...
AbstractIn this paper, the index and the period for a lattice matrix are estimated. Some necessary a...
학위논문 (석사)-- 서울대학교 대학원 : 수학교육과, 2014. 8. 김서령.In this thesis, we extend the results given by Park et a...
AbstractLet A be a k×k matrix over a ring R; let GM(A,R) be the digraph with vertex set Rk, and an a...
AbstractFor a positive integer m where 1⩽m⩽n, the m-competition index (generalized competition index...
The notions introduced in Braker and Resing (1992), concerning periodicity of 2×2 matrices in a gene...
AbstractFirst we give a new proof of the sharp upper bound for the indices of convergence of n x n i...
summary:We obtain upper bounds for generalized indices of matrices in the class of nearly reducible ...
AbstractWe obtain explicit formulas for the index set Rn of the class of n × n reducible boolean mat...
AbstractLet IBM(n, p) denote the set of all n × n irreducible Boolean matrices with period p. This p...
AbstractWe study sequences of optimal walks of a growing length in weighted digraphs, or equivalentl...
Abstract. Cho and Kim [4] have introduced the concept of the compe-tition index of a digraph. Simila...
The adjacency matrix A of a graph G is a 0-1 matrix. The Boolean power sequence of A is convergent o...
AbstractThe index of maximum density of a Boolean (or nonnegative) matrix A is defined as the least ...
AbstractInclines are the additively idempotent semirings in which products are less than or equal to...
AbstractIn 1990 Brualdi and Liu (J. Graph Theory 14 (1990) 483) introduced the concept of generalize...
AbstractIn this paper, the index and the period for a lattice matrix are estimated. Some necessary a...
학위논문 (석사)-- 서울대학교 대학원 : 수학교육과, 2014. 8. 김서령.In this thesis, we extend the results given by Park et a...
AbstractLet A be a k×k matrix over a ring R; let GM(A,R) be the digraph with vertex set Rk, and an a...
AbstractFor a positive integer m where 1⩽m⩽n, the m-competition index (generalized competition index...
The notions introduced in Braker and Resing (1992), concerning periodicity of 2×2 matrices in a gene...