Description Usage Arguments Details Value Author(s) References See Also Examples
Tests whether a hypergraph is conformal.
1 2 | is.conformal(h)
is.bi.conformal(h)
|
h |
a hypergraph. |
A hypergraph h is conformal if all the maximal cliques of its 2-section are the maximal (by inclusion) edges of h. The test uses a theorem (see the reference, Theorem 7.6.4) that says a hypergraph is conformal if and only if its dual is Helly. A hypergraph is bi-conformal if it and its dual are conformal.
a logical.
David J. Marchete dmarchette@gmail.com
Voloshin, Vitaly I. Introduction to graph and hypergraph theory. Nova Science Publ., 2009.
1 2 3 4 5 6 | h <- hypergraph_from_edgelist(list(1:4,3:6,5:10))
is.conformal(h)
## TRUE
h <- hypergraph_from_edgelist(list(1:2,2:3,c(1,3)))
is.conformal(h)
## FALSE
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.