This function tests if a given graph is a chordal graph. A chordal graph is an undirected graph such that any cycle of length greater than 3 must have a chord. It has dependency on the function is_chordal in the igraph package.
1 | is_chordal(graph)
|
graph |
A graph that is stored in an adjacency matrix. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.