subtree.hypergraph {HyperG}

Subtree Hypergraph.

Description

Construct a subtree hypergraph from a graph.

Usage

subtree.hypergraph(g, v)

Arguments

g

a graph.

v

a list of vertex sets. See details.

Details

A subtree hypergraph is a hypergraph on the vertices of the graph g, each of whose hyper-edges induces a subtree in g. If v is given, each element of the list must contain at least two elements. For each element of v, all paths between it's first element and each of the other elements are computed, and the hyper-edge corresponds to all the vertices in these paths.

Value

a hypergraph.

Note

There are many possible subtree hypergraphs for a given graph. The default is to loop through the vertices in a particular way to generate a hypergraph. The intent is that the use should provide v, rather than using this admittedly arbitrary algorithm.

Author(s)

David J. Marchette [e-mail]

References

Bretto, Alain, Hypergraph theory, An introduction. Springer, 2013.

Examples

   g <- make_tree(20,mode='undirected')