Logical, whether the multiple edges are to be
removed.

remove.loops

Logical, whether the loop edges are to be removed.

edge.attr.comb

Specifies what to do with edge attributes, if
remove.multiple=TRUE. In this case many edges might be mapped to a
single one in the new graph, and their attributes are combined. Please see
attribute.combination for details on this.

Value

A new graph object with the edges deleted.

Details

A loop edge is an edge for which the two endpoints are the same
vertex. Two edges are multiple edges if they have exactly the same two
endpoints (for directed graphs order does matter). A graph is simple is
it does not contain loop edges and multiple edges.

is_simple checks whether a graph is simple.

simplify removes the loop and/or multiple edges from a graph. If
both remove.loops and remove.multiple are TRUE the
function returns a simple graph.