|
GraphTheory[IsCutSet]
|
|
Calling Sequence
|
|
IsCutSet(G, E)
|
|
|
Parameters
|
|
|
G
|
-
|
graph E : edge or set of edges
|
|
|
|
|
|
Description
|
|
|
•
|
IsCutSet tests whether the edge set E is a cut-set of the graph G. If so, then removing the edges of E disconnects the graph if the graph is connected or, in general, increase the number of connected components.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
|
>
|
|
|
| (5) |
|
|
Download Help Document
Was this information helpful?
