getGoodLeaf -- returns an edge that is a good leaf

Synopsis

Usage:

L = getGoodLeaf(H)
Inputs:
- H, a hypergraph,
Outputs:
- L, a list, of vertices that comprise an edge in H that is a good leaf

Description

A good leaf of a hypergraph H is an edge L whose intersections with all other edges form a totally ordered set. It follows that L must have a free vertex, i.e., a vertex contained in no other edges. In the graph setting, a good leaf is an edge containing a vertex of degree one. The notion of a good leaf was introduced by X. Zheng in her Ph.D. thesis (2004).

i1 : R = QQ[a..g];

i2 : H = hyperGraph {a*b*c*d, b*c*d*e, c*d*f, d*g, e*f*g};

i3 : getGoodLeaf(H)

o3 = {a, b, c, d}

o3 : List

Ways to use getGoodLeaf:

getGoodLeaf(HyperGraph)

For the programmer

The object getGoodLeaf is a method function.

getGoodLeaf -- returns an edge that is a good leaf

Synopsis

Description

See also

Ways to use getGoodLeaf:

For the programmer