gives graph g minus the list of edges edgeList. If g is undirected, then the edges in edgeList are treated as undirected edges; otherwise they are treated as directed edges. If there are multiple edges that qualify, then only one edge is deleted.
will delete all edges that qualify. If only one edge is to be deleted, then edgeList can have the form ; otherwise it has the form .
- Computation on Graphs
- Constructing Graphs
- Discrete Mathematics
- Graph Construction & Representation
- Graph Operations and Modifications
- Graph Properties
- Graph Properties & Measurements
- Graphs and Matrices
- Graphs & Networks
- Graph Visualization
- Mathematical Data Formats
- Statistical Analysis
- Social Network Analysis