A good leaf of 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. 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 : edges(H) o3 = {{a, b, c, d}, {b, c, d, e}, {c, d, f}, {d, g}, {e, f, g}} o3 : List |
i4 : isGoodLeaf(H,0) o4 = true |
i5 : isGoodLeaf(H,1) o5 = false |
The object isGoodLeaf is a method function.