next | previous | forward | backward | up | top | index | toc | Macaulay2 web site
BinomialEdgeIdeals :: isEffective

isEffective -- A test for being an effective disconnector

Synopsis

Description

This routine checks whether a Set or a List is an effective disconnector of a graph
needsPackage("Graphs")
G=graph({{1,2},{2,3},{3,1}})
S={1}
isEffective(G,S)

See also

Ways to use isEffective :