Graph G and Adjacency Matrix A:
Bipartite Graph G and Adjacency Matrix:
Tournament(K) and its Matrix A(K)
Tournament(K) and its Matrix AT(K)
For a Tournament(K):
A(K)+AT(K)=J-I
Boolean Rank, b(A), of a {0,1}-matrix A
Independent 1's, t(A), of a matrix A