next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
Graphs
(missing documentation) ::
isChordal
isChordal -- checks whether a graph is chordal
Synopsis
Usage:
c = isChordal G
Inputs:
G
,
an object of class
Graph
(missing documentation)
Outputs:
c
,
a
Boolean value
, whether the graph is chordal
Description
A graph is chordal if its cycles with at least four vertices contain at least one edge between two vertices which are not adjacent in the cycle.
i1 : G = graph({{1,2},{2,3},{3,4},{4,1},{2,4}}, EntryMode => "edges");
i2 : isChordal G o2 = true
See also
cycleGraph
-- Constructs a cycle graph
isPerfect
-- checks whether a graph is perfect
hasOddHole
-- checks whether a graph has a odd hole
Ways to use
isChordal
:
isChordal(Graph)