We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied, and whose product is square. Cycles in this graph have a parity, that is, they are either even (termed e-cycles) or odd (termed o-cycles). The absence of e-cycles in the graph is shown to imply that the matrix product is a P0-matrix, i.e., all of its principal minors are nonnegative. Conversely, the presence of an e-cycle is shown to imply that there exists a list of matrices associated with the graph whose product fails to be a P0-matrix. The results generalise a number of previous results relating P- and P0-matrices to graphs
AbstractThe relations between several necessary conditions for a square complex matrix A to be m-cyc...
[[abstract]]The relations between several necessary conditions for a square complex matrix A to be m...
AbstractWe show that if A is an M-matrix for which the length of the longest simple cycle in its ass...
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied,...
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied,...
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied,...
AbstractWe associate a signed digraph with a list of matrices whose dimensions permit them to be mul...
AbstractWe associate a signed digraph with a list of matrices whose dimensions permit them to be mul...
AbstractFor sign patterns corresponding to directed or undirected cycles, we identify conditions und...
AbstractWe provide positive answers to some open questions presented recently by Kim and Shader on a...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
For sign patterns corresponding to directed or undirected cycles, we identify conditions under which...
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative...
AbstractAs a model problem in qualitative matrix technology, we consider the possible arrangements o...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractThe relations between several necessary conditions for a square complex matrix A to be m-cyc...
[[abstract]]The relations between several necessary conditions for a square complex matrix A to be m...
AbstractWe show that if A is an M-matrix for which the length of the longest simple cycle in its ass...
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied,...
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied,...
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied,...
AbstractWe associate a signed digraph with a list of matrices whose dimensions permit them to be mul...
AbstractWe associate a signed digraph with a list of matrices whose dimensions permit them to be mul...
AbstractFor sign patterns corresponding to directed or undirected cycles, we identify conditions und...
AbstractWe provide positive answers to some open questions presented recently by Kim and Shader on a...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
For sign patterns corresponding to directed or undirected cycles, we identify conditions under which...
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative...
AbstractAs a model problem in qualitative matrix technology, we consider the possible arrangements o...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractThe relations between several necessary conditions for a square complex matrix A to be m-cyc...
[[abstract]]The relations between several necessary conditions for a square complex matrix A to be m...
AbstractWe show that if A is an M-matrix for which the length of the longest simple cycle in its ass...