test if graph is chordal
(optional) one or more options as specified below
eliminationordering : keyword option of the form eliminationordering=true or eliminationordering=false.
Specifies whether an elimination ordering should be returned when G is chordal. The default is false.
usecached : keyword option of the form usecached=true or usecached=false.
Specifies whether previously stored information should be used, if available. The default is true.
The IsChordal(G) command returns true if G is a chordal graph and false otherwise.
An undirected graph G is chordal if every cycle of length 4 or more has a chord, that is, an edge that is not part of the cycle but connects two vertices of the cycle.
Every interval graph is a chordal graph.
Every split graph is a chordal graph.
The cycle graph on four vertices is not chordal by definition, since it is a 4-cycle without a chord.
C4 ≔ CycleGraph⁡4
C4≔Graph 1: an undirected graph with 4 vertices and 4 edge(s)
The complete graph on four vertices is chordal.
K4 ≔ CompleteGraph⁡4
K4≔Graph 2: an undirected graph with 4 vertices and 6 edge(s)
The Petersen graph is not chordal.
P ≔ SpecialGraphs:-PetersenGraph⁡
P≔Graph 3: an undirected graph with 10 vertices and 15 edge(s)
The GraphTheory[IsChordal] command was introduced in Maple 2022.
For more information on Maple 2022 changes, see Updates in Maple 2022.
Download Help Document