|
GraphTheory[IsBipartite]
|
|
Calling Sequence
|
|
IsBipartite(G)
IsBipartite(G, P)
|
|
|
Parameters
|
|
|
G
|
-
|
graph
|
|
P
|
-
|
(optional) name
|
|
|
|
|
|
Description
|
|
|
•
|
IsBipartite returns true if the graph G is bipartite and false otherwise. If a variable name P is specified, then this name is assigned a bipartition of the vertices as a list of lists.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
![[[1, 2, 3], [4, 5]]](/support/helpjp/helpview.aspx?si=6074/file01829/math102.png)
| (3) |
|
>
|
|
|
>
|
|
|
![Matrix([[0, 0, 0, 1, 1], [0, 0, 0, 1, 1], [0, 0, 0, 1, 1], [1, 1, 1, 0, 0], [1, 1, 1, 0, 0]])](/support/helpjp/helpview.aspx?si=6074/file01829/math118.png)
| (4) |
|
>
|
|
|
| (5) |
|
>
|
|
|
| (6) |
|
|
Download Help Document
Was this information helpful?
