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

# isDisconnector -- A test for being a disconnector

- Usage:
    `isDisconnector(G,S)`
- Inputs:
  - G, a Graph or a List
  - S, a List or a Set
- Outputs:
  - true or false, depending on wheater S is a disconnector of G

## 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

- disconnectors -- Disconnectors of a graph

## Ways to use isDisconnector:

- `isDisconnector(List,List)`
- `isDisconnector(List,Set)`

## For the programmer

The object isDisconnector is a method function.

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/BinomialEdgeIdeals.m2:265:0.