TOPICS
Search

Edge Deletion


The deletion of a graph edge e from a graph G is the operation of removing e while leaving its endpoints and all other graph edges unchanged. The resulting graph is denoted G-e.

Edge deletion is implemented in the Wolfram Language as EdgeDelete[g, e] or EdgeDelete[g, {e1, e2, ...}].


See also

Edge Contraction, Graph Minor, Vertex Deletion

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Edge Deletion." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/EdgeDeletion.html

Subject classifications