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:
“God cannot be seen: he is too bright for sight; nor grasped: he is too pure for touch; nor measured: for he is beyond all sense, infinite, measureless, his dimension known to himself alone.”
—Marcus Minucius Felix (2nd or 3rd cen. A.D.)