Adjacency Matrix of A Bipartite Graph
The adjacency matrix A of a bipartite graph whose parts have r and s vertices has the form
where B is an r × s matrix and O is an all-zero matrix. Clearly, the matrix B uniquely represents the bipartite graphs. It is sometimes called the biadjacency matrix. Formally, let G = (U, V, E) be a bipartite graph with parts and . The biadjacency matrix is the r x s 0-1 matrix B in which iff .
If G is a bipartite multigraph or weighted graph then the elements are taken to be the number of edges between the vertices or the weight of the edge respectively.
Read more about this topic: Adjacency Matrix
Famous quotes containing the words matrix and/or graph:
“As all historians know, the past is a great darkness, and filled with echoes. Voices may reach us from it; but what they say to us is imbued with the obscurity of the matrix out of which they come; and try as we may, we cannot always decipher them precisely in the clearer light of our day.”
—Margaret Atwood (b. 1939)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)