Structure of singular and nonsingular tournament matrices

Matt Burnham

A tournament is a directed graph resulting from an orientation of the complete graph; so, if $M$ is a tournament's adjacency matrix, then $M+M^T$ is a matrix with $0$s on its dia…