AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2, …, rn are the row-sums of a tournament matrix. In this paper a new proof of this result is obtained
AbstractFor a primitive generalized tournament matrix, we present upper and lower bounds on an entry...
AbstractWe establish the conjecture of Brualdi and Li on the maximal Perron root of a tournament mat...
AbstractGale and Ryser have given a necessary and sufficient condition for the existence of a matrix...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
AbstractVarious results are derived about the adjacency matrix of a tournament; in particular, it is...
AbstractPerron values of tournament matrices have been of interest to a number of authors recently. ...
AbstractIn this paper we use tournament matrices to give a combinatorial interpretation for the entr...
Let R and S be non-negative and non-increasing vectors of order m and n respectively. We consider th...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractLet T be a tournament on n nodes, and let A be its (adjacency) matrix. A. Brauer and I. Gent...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
AbstractLet T be an almost regular tournament matrix of order n with right perron vector w. We show ...
AbstractFor a primitive generalized tournament matrix, we present upper and lower bounds on an entry...
AbstractWe establish the conjecture of Brualdi and Li on the maximal Perron root of a tournament mat...
AbstractGale and Ryser have given a necessary and sufficient condition for the existence of a matrix...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
AbstractA tournament T on any set X is a dyadic relation such that for any x, y ∈ X (a) (x, x) ∉ T a...
AbstractVarious results are derived about the adjacency matrix of a tournament; in particular, it is...
AbstractPerron values of tournament matrices have been of interest to a number of authors recently. ...
AbstractIn this paper we use tournament matrices to give a combinatorial interpretation for the entr...
Let R and S be non-negative and non-increasing vectors of order m and n respectively. We consider th...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractLet T be a tournament on n nodes, and let A be its (adjacency) matrix. A. Brauer and I. Gent...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
AbstractLet T be an almost regular tournament matrix of order n with right perron vector w. We show ...
AbstractFor a primitive generalized tournament matrix, we present upper and lower bounds on an entry...
AbstractWe establish the conjecture of Brualdi and Li on the maximal Perron root of a tournament mat...
AbstractGale and Ryser have given a necessary and sufficient condition for the existence of a matrix...
DOI
Add to ORKG