The biadjacency matrix of a bipartite graph with vertex parts 
and 
is the 
0-1 matrix 
whose entry 
is 1 iff 
and 
are adjacent. Unlike an adjacency
matrix, a biadjacency matrix need not be square.
With the vertices ordered by the two parts, the adjacency
matrix of the bipartite graph has block form
![[0 B; B^T 0].](/images/equations/BiadjacencyMatrix/NumberedEquation1.svg) |
