makes a graph by deleting the vertex ν and all edges connected to v from the graph g.
deletes a collection of vertices from g.
deletes all vertices that match the pattern patt.
uses rules vw to specify the graph g.
Details and Options
- VertexDelete[g,v] will delete the vertex v only if it is present in g.
- VertexDelete works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examplesopen allclose all
VertexDelete works with undirected graphs:
Delete a set of vertices from the graph:
Use rules to specify the graph:
Use a pattern to delete a subset of vertices:
VertexDelete works with large graphs:
Wolfram Research (2010), VertexDelete, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexDelete.html (updated 2015).
Wolfram Language. 2010. "VertexDelete." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/VertexDelete.html.
Wolfram Language. (2010). VertexDelete. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexDelete.html