Encyclopedia > B > Biadjacency matrix
Biadjacency matrix
In mathematics and computer science, the biadjacency matrix of a finite bipartite graph G with n black vertices and m white vertices is an n Ă— m matrix where the entry aij is the number of edges joining black vertex i and white vertex j. In the special case of a finite, undirected, simple bipartite graph, the biadjacency matrix is a (0,1)-matrix.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)