Macaulay2 » Documentation
Packages » Graphs :: coverIdeal
next | previous | forward | backward | up | index | toc

coverIdeal -- Returns the vertex cover ideal of a graph

Synopsis

Description

The vertex cover ideal of a graph G is the ideal generated by (m_s | s in [n] is a vertex cover of G), where m_s = product_(i in S)(x_i)

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

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

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

See also

Ways to use coverIdeal :

For the programmer

The object coverIdeal is a method function.