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:
““The matrix is God?”
“In a manner of speaking, although it would be more accurate ... to say that the matrix has a God, since this being’s omniscience and omnipotence are assumed to be limited to the matrix.”
“If it has limits, it isn’t omnipotent.”
“Exactly.... Cyberspace exists, insofar as it can be said to exist, by virtue of human agency.””
—William Gibson (b. 1948)
“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)