next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
BinomialEdgeIdeals
::
isEffective
isEffective -- A test for being an effective disconnector
Synopsis
Usage:
isEffective(G,S)
Inputs:
G
, a Graph or a List
S
, a List or a Set
Optional inputs
:
UseHypergraphs => ...
(missing documentation),
Outputs:
true or false, depending on whether S is an effective disconnector of G
Description
This routine checks whether a Set or a List is an effective disconnector of a graph
needsPackage("Graphs")
G=graph({{1,2},{2,3},{3,1}})
S={1}
isEffective(G,S)
See also
disconnectors
-- Disconnectors of a graph
Ways to use
isEffective
:
isEffective(List,List)
isEffective(List,Set)