next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
Graphs
(missing documentation) ::
isCM
isCM -- determines if a graph is Cohen-Macaulay
Synopsis
Usage:
c = isCM G
Inputs:
G
,
an object of class
Graph
(missing documentation)
Outputs:
c
,
a
Boolean value
, whether the graph is Cohen-Macaulay
Description
This uses the edge ideal notion of Cohen-Macaulayness; a graph is called C-M if and only if its edge ideal is C-M.
i1 : G = graph({{1,2},{1,3},{1,4},{2,5},{5,3},{3,2}},EntryMode=>"edges");
i2 : isCM G o2 = true
See also
edgeIdeal
-- returns the edge ideal of a graph
Ways to use
isCM
:
isCM(Graph)