Category:Definitions/Examples of Complete Bipartite Graphs

From ProofWiki
Jump to navigation Jump to search

This category contains definitions of examples of Complete Bipartite Graph.


A complete bipartite graph is a bipartite graph $G = \struct {A \mid B, E}$ in which every vertex in $A$ is adjacent to every vertex in $B$.

The complete bipartite graph where $A$ has $m$ vertices and $B$ has $n$ vertices is denoted $K_{m, n}$.

Subcategories

This category has only the following subcategory.

Pages in category "Definitions/Examples of Complete Bipartite Graphs"

This category contains only the following page.