next | previous | forward | backward | up | top | index | toc | Macaulay2 website
BinomialEdgeIdeals :: isDisconnector

isDisconnector -- A test for being a disconnector

Synopsis

Description

This routine checks wheater a Set or a List is a 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 : isDisconnector(G,S)

o4 = true

See also

Ways to use isDisconnector :

For the programmer

The object isDisconnector is a method function.