graph E : edge or set of edges
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.
G ≔ Graph⁡1,2,1,3,2,3,1,4,3,4,4,5,5,6,4,6
G≔Graph 1: an undirected unweighted graph with 6 vertices and 8 edge(s)
S ≔ 1,4,3,4
Graph 1: an undirected unweighted graph with 6 vertices and 6 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)