# deleteEdges -- returns the (hyper)graph with specified edges removed

## Synopsis

• Usage:
h = deleteEdges(H, S)
• Inputs:
• H,
• S, a list, a subset of the edges of the graph or hypergraph
• Outputs:
• h, , the hypergraph with edges in S removed

## Description

This function enables the user to remove specified edges from a hypergraph to form a subhypergraph.
 `i1 : S = QQ[a,b,c,d,e];` ```i2 : g = cycle S o2 = Graph{edges => {{a, b}, {b, c}, {c, d}, {d, e}, {a, e}}} ring => S vertices => {a, b, c, d, e} o2 : Graph``` ```i3 : T = {{a,b},{d,e}} o3 = {{a, b}, {d, e}} o3 : List``` ```i4 : gprime = deleteEdges (g,T) o4 = HyperGraph{edges => {{c, d}, {b, c}, {a, e}}} ring => S vertices => {a, b, c, d, e} o4 : HyperGraph``` ```i5 : h = hyperGraph {a*b*c,c*d*e,a*e} o5 = HyperGraph{edges => {{a, b, c}, {a, e}, {c, d, e}}} ring => S vertices => {a, b, c, d, e} o5 : HyperGraph``` ```i6 : T = edges h o6 = {{a, b, c}, {a, e}, {c, d, e}} o6 : List``` ```i7 : hprime = deleteEdges (h,T) o7 = HyperGraph{edges => {} } ring => S vertices => {a, b, c, d, e} o7 : HyperGraph```

## Ways to use deleteEdges :

• deleteEdges(HyperGraph,List)