makes a graph by deleting the edge e from the graph g.
deletes a collection of edges from g.
deletes all edges that match the pattern patt.
uses rules vw to specify the graph g.
Details and Options
- EdgeDelete[g,e] will delete the edge e only if it is present in g.
- An undirected edge can be specified using vw or UndirectedEdge[v,w].
- A directed edge can be specified using vw or DirectedEdge[v,w].
Examplesopen allclose all
Basic Examples (1)
Delete an edge from a complete graph:
EdgeDelete works with undirected graphs:
Delete a set of edges from the graph:
Use rules to specify the graph:
Use a pattern to delete a subset of edges:
EdgeDelete works with large graphs:
Introduced in 2010
Updated in 2015