Description Usage Arguments Details Value Author(s) References Examples
Tests whether a hypergraph is a star. Finds the minimal intersection set of the hyper-edges.
1 2 | is.star(h,type=c("weak","strong"))
intersection_set(h)
|
h |
a hypergraph. |
type |
see Details. |
A (weak) star hypergraph is one in which the intersection of all the hyper-edges is non-empty.
An intersection set is a set of vertices that is contained in every
edge.
The argument type="strong"
for is.star
indicates that the only vertices which
are common between any pair of vertices are contained in the intersection set
(or "hub") of the star hypergraph. So a hypergraph that is strongly
star is weakly star, but not vice versa.
a logical, for is.star
. A set of vertices (or NULL) that are contained
in every hyper-edge. This would be the "hub" of the star.
David J. Marchette dmarchette@gmail.com.
Akram, M., & Luqman, A. (2020). Fuzzy hypergraphs and related extensions. Springer Singapore.
1 2 3 4 5 6 7 8 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.