Abstract
A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A bipartite graph is a special case of a k-partite graph with k=2. The illustration above shows some bipartite graphs, with vertices in each graph colored based on to which of the two disjoint sets they belong. Bipartite graphs are equivalent to two-colorable graphs. All acyclic graphs are bipartite. A cyclic graph is...
Cite
CITATION STYLE
Zepeda-Mendoza, M. L., & Resendis-Antonio, O. (2013). Bipartite Graph. In Encyclopedia of Systems Biology (pp. 147–148). Springer New York. https://doi.org/10.1007/978-1-4419-9863-7_1370
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
