edgeIdeal -- returns the edge ideal of a graph

Synopsis

• Usage:

  I = edgeIdeal G

• Inputs:
  • G, an instance of the type Graph
• Outputs:
  • I, an ideal, the edge ideal of a graph G

Description

i1 : G = graph({{1, 2}, {1, 3}, {2, 3}, {3, 4}},EntryMode=>"edges");

i2 : edgeIdeal G

o2 = monomialIdeal (x x , x x , x x , x x )
                     1 2   1 3   2 3   3 4

o2 : MonomialIdeal of QQ[x ..x ]
                          1   4

See also

• coverIdeal -- Returns the vertex cover ideal of a graph
• independenceComplex -- constructs the independence complex of a graph