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
G={{1,2},{2,3},{3,1}}
d = disconnectors(G)
d = disconnectors(G,EffectiveOnly=>true)
See also
isEffective
-- A test for being an effective disconnector
Ways to use
disconnectors
:
disconnectors(List)