In the mathematical field of graph theory, the bipartite dimension of a graph G = (V, E) is the minimum number of bicliques, that is, complete bipartite subgraphs, needed to cover all edges in E. A collection of bicliques covering all edges in G is called a biclique edge cover, or sometimes biclique cover. The bipartite dimension of G is often denoted by the symbol d(G).
Read more about Bipartite Dimension: Example, Bipartite Dimension Formulas For Some Graphs, Computing The Bipartite Dimension, Applications, See Also
Famous quotes containing the word dimension:
“By intervening in the Vietnamese struggle the United States was attempting to fit its global strategies into a world of hillocks and hamlets, to reduce its majestic concerns for the containment of communism and the security of the Free World to a dimension where governments rose and fell as a result of arguments between two colonels wives.”
—Frances Fitzgerald (b. 1940)