A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the existence of an out-tournament whose adjacency matrix has boolean, nonnegative integer, and real rank all equal, and less than the number of vertices n. Corresponding results for biclique covers and partitions of the digraph are provided.
展开▼
