next | previous | forward | backward | up | top | index | toc | Macaulay2 website
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
i1 : needsPackage("Graphs")

o1 = Graphs

o1 : Package
i2 : G=graph({{1,2},{2,3},{3,1}})

o2 = Graph{1 => {2, 3}}
           2 => {1, 3}
           3 => {1, 2}

o2 : Graph
i3 : S={1}

o3 = {1}

o3 : List
i4 : isEffective(G,S)

o4 = false

See also

Ways to use isEffective :

For the programmer

The object isEffective is a method function with options.