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

BinomialEdgeIdeals :: disconnectors

disconnectors -- Disconnectors of a graph

Synopsis

Usage:
disconnectors G
Inputs:
- G, a Graph or a List
Optional inputs:
- EffectiveOnly => ... (missing documentation),
Outputs:
- the disconnectors of G

Description

This routine computes the disconnectors of the parity binomial edge ideal and the permanental binomial edge ideal of G

i1 : G={{1,2},{2,3},{3,1}}

o1 = {{1, 2}, {2, 3}, {3, 1}}

o1 : List

i2 : d = disconnectors(G)

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

o2 : List

i3 : d = disconnectors(G,EffectiveOnly=>true)
using temporary file name /tmp/M2-5302-0/0
using temporary file name /tmp/M2-5302-0/1

o3 = {{}, {3}, {2}, {1}}

o3 : List

See also

isEffective -- A test for being an effective disconnector

Ways to use `disconnectors` :

disconnectors(List)