Category:Complete Bipartite Graphs
Jump to navigation
Jump to search
This category contains results about Complete Bipartite Graphs.
Definitions specific to this category can be found in Definitions/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 the following 2 subcategories, out of 2 total.
T
- Thomsen Graph (1 P)
Pages in category "Complete Bipartite Graphs"
The following 12 pages are in this category, out of 12 total.
C
- Complete Bipartite Graphs which are Complete Graphs
- Complete Bipartite Graphs which are Cycle Graphs
- Complete Bipartite Graphs which are Path Graphs
- Complete Bipartite Graphs which are Regular
- Complete Bipartite Graphs which are Trees
- Complete Hamiltonian Bipartite Graph
- Condition for Complete Bipartite Graph to be Edgeless
- Condition for Complete Bipartite Graph to be Semi-Hamiltonian