b = isLeaf(G,N)
b = isLeaf(H,n)
b = isLeaf(H,V)
An edge in a graph is a leaf if it contains a vertex of degree one. An edge E in a hypergraph is a leaf if there is another edge B with the property that for all edges F (other than E), the intersection of F with E is contained in the intersection of B with E.
A vertex of a graph is a leaf if it has degree one. A vertex of a hypergraph is a leaf if it is contained in precisely one edge which is itself is leaf.












The object isLeaf is a method function.