Description Usage Arguments Details Value Author(s) References Examples
Tests whether a hypergraph is simple or linear.
1 2 |
h |
a hypergraph. Can be a graph for |
A hypergraph is simple if all it's edges are distinct, non-empty, and if edge i is contained in edge j, then i=j. A hypergraph is linear if it is simple and the intersection of any two hyper-edges has at most one element.
a logical.
David J. Marchette dmarchette@gmail.com.
Akram, M., & Luqman, A. (2020). Fuzzy hypergraphs and related extensions. Springer Singapore.
1 2 3 | h <- hypergraph_from_edgelist(list(1:4,4:7,c(6,8:10),10:14))
is.linear(h) ## TRUE
is.simple(h) ## TRUE
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.