This is an old revision of the document!
Bipartite adjacency matrix
Set
$n_X,n_Y\in\mathbb N$ |
$ A \in \mathrm{it}(n_X,n_Y) $ |
$ A \in \mathrm{Matrix}(n_X,n_Y,\mathbb N) $ |
Discussion
If the indices $i,j$ label two vertices belonging to the partitions $X,Y$ of a finite bipartite graph, respectively, then the value $A_{ij}$ determines the number of edges joining them.