AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that are equivalent to M being singular. A correlation between the number of 3-cycles in T and the rank of M is established. It is shown that asymptotically at least 12 of the tournament matrices are nonsingular. We also derive bounds on the spectral radius of tournament matrices with a given row-sum vector
AbstractVarious results are derived about the adjacency matrix of a tournament; in particular, it is...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractFor a primitive generalized tournament matrix, we present upper and lower bounds on an entry...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
Much work has been done in analyzing various classes of tournaments, giving a partial characterizati...
AbstractVarious results are derived about the adjacency matrix of a tournament; in particular, it is...
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
For a tournament matrix M of order n, we define its walk space, WM , to be SpanfM j 1 : j = 0; . ....
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use lo...
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use lo...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
Let A be a (0,1,∗)-matrix with main diagonal all 0’s and such that if ai,j=1 or ∗ then aj,i=∗ or 0. ...
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use lo...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
AbstractVarious results are derived about the adjacency matrix of a tournament; in particular, it is...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractFor a primitive generalized tournament matrix, we present upper and lower bounds on an entry...
AbstractLet T be a tournament of order n with adjacency matrix M. We find several conditions that ar...
Much work has been done in analyzing various classes of tournaments, giving a partial characterizati...
AbstractVarious results are derived about the adjacency matrix of a tournament; in particular, it is...
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
For a tournament matrix M of order n, we define its walk space, WM , to be SpanfM j 1 : j = 0; . ....
AbstractLet T(S) be the set of tournament matrices with nonincreasing column sum vector S = (s1,…,sn...
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use lo...
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use lo...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
Let A be a (0,1,∗)-matrix with main diagonal all 0’s and such that if ai,j=1 or ∗ then aj,i=∗ or 0. ...
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use lo...
AbstractH. G. Landau obtained necessary and sufficient conditions that non-negative integers r1, r2,...
AbstractVarious results are derived about the adjacency matrix of a tournament; in particular, it is...
AbstractLet T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brual...
AbstractFor a primitive generalized tournament matrix, we present upper and lower bounds on an entry...
DOI
Add to ORKG