A new proof of a theorem by H. G. Landau on tournament matrices
From MaRDI portal
Publication:5551492
DOI10.1016/S0021-9800(68)80074-2zbMath0165.32703OpenAlexW2052245862MaRDI QIDQ5551492
Ivey C. Gentry, Kay Shaw, Alfred Brauer
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(68)80074-2
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
Tournaments, oriented graphs and football sequences ⋮ On the graph Laplacian and the rankability of data ⋮ On linear programming duality and Landau's characterization of tournament ⋮ On \(k\)-hypertournament matrices ⋮ Score vectors of tournaments
This page was built for publication: A new proof of a theorem by H. G. Landau on tournament matrices
