Macaulay2 » Documentation
Packages » BinomialEdgeIdeals :: disconnectors
next | previous | forward | backward | up | index | toc

disconnectors -- Disconnectors of a graph

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)

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

o3 : List

See also

Ways to use disconnectors:

  • disconnectors(List)

For the programmer

The object disconnectors is a method function with options.


The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/BinomialEdgeIdeals.m2:244:0.