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) => ..., default value false,
• Outputs:
  • true or false, depending on whether S is an effective disconnector of G

Description

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 : isEffective(G,S)

o4 = false

See also

• disconnectors -- Disconnectors of a graph