TOPICS
Search

Vertex Deletion


The deletion of a graph vertex v from a graph G is the operation of removing v and all graph edges incident with v. The resulting graph is denoted G-v and is the vertex-induced subgraph on the vertex set V(G)-{v}.

Vertex deletion is implemented in the Wolfram Language as VertexDelete[g, v] or VertexDelete[g, {v1, v2, ...}].


See also

Edge Deletion, Graph Deck, Vertex Contraction, Vertex-Induced Subgraph

Explore with Wolfram|Alpha

Cite this as:

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

Subject classifications