isGraph -- determines if a hypergraph is a graph

• Usage:

  b = isGraph H

• Inputs:
  • H, a hypergraph,
• Outputs:
  • b, a Boolean value, true if all edges in H have size two

i1 : QQ[a,b,c,d];

i2 : isGraph(hyperGraph {a*b,b*c,c*d})

o2 = true

i3 : isGraph(hyperGraph {a*b,b*c*d})

o3 = false

i4 : isGraph(hyperGraph {a*b,b*c,d})

o4 = false