|
|
|
|
complete bipartite graph
|
(Definition)
|
|
|
The complete bipartite graph  is a graph with two sets of vertices, one with  members and one with  , such that each vertex in one set is adjacent to every vertex in the other set and to no vertex in its own set. As the name implies,  is bipartite.
Examples of complete bipartite graphs:
 :
 :
|
"complete bipartite graph" is owned by yark. [ full author list (2) | owner history (1) ]
|
|
(view preamble)
Cross-references: bipartite, implies, adjacent, vertex, vertices, graph
There are 5 references to this entry.
This is version 4 of complete bipartite graph, born on 2002-02-03, modified 2006-01-24.
Object id is 1784, canonical name is CompleteBipartiteGraph.
Accessed 4476 times total.
Classification:
| AMS MSC: | 05C15 (Combinatorics :: Graph theory :: Coloring of graphs and hypergraphs) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
![$\displaystyle \begin{xy} *!C\xybox{ \xymatrix{ & C \ A \ar@{-}[ur] \ar@{-}[r]... ...[uuur] \ar@{-}[uur] \ar@{-}[ur] \ar@{-}[r] \ar@{-}[dr] & F \ & G } } \end{xy}$](http://images.planetmath.org:8080/cache/objects/1784/l2h/img6.png "$\displaystyle \begin{xy} *!C\xybox{ \xymatrix{ & C \ A \ar@{-}[ur] \ar@{-}[r]... ...[uuur] \ar@{-}[uur] \ar@{-}[ur] \ar@{-}[r] \ar@{-}[dr] & F \ & G } } \end{xy}$")
![$\displaystyle \begin{xy} *!C\xybox{ \xymatrix{ A \ar@{-}[r] \ar@{-}[dr] \ar@{-}... ...}[r] \ar@{-}[dr] & E \ C \ar@{-}[uur] \ar@{-}[ur] \ar@{-}[r] & F } } \end{xy}$](http://images.planetmath.org:8080/cache/objects/1784/l2h/img8.png "$\displaystyle \begin{xy} *!C\xybox{ \xymatrix{ A \ar@{-}[r] \ar@{-}[dr] \ar@{-}... ...}[r] \ar@{-}[dr] & E \ C \ar@{-}[uur] \ar@{-}[ur] \ar@{-}[r] & F } } \end{xy}$")