Category:Definitions/Complete Bipartite Graphs
Jump to navigation
Jump to search
This category contains definitions related to Complete Bipartite Graphs.
Related results can be found in Category:Complete Bipartite Graphs.
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.
E
Pages in category "Definitions/Complete Bipartite Graphs"
The following 2 pages are in this category, out of 2 total.