VertexDelete

VertexDelete[g,v]

makes a graph by deleting the vertex ν and all edges connected to v from the graph g.

VertexDelete[g,{v1,v2,…}]

deletes a collection of vertices from g.

VertexDelete[g,patt]

deletes all vertices that match the pattern patt.

VertexDelete[{vw,…},…]

uses rules vw to specify the graph g.

Details and Options

  • VertexDelete is also known as vertex removal.
  • 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.

Examples

open allclose all

Basic Examples  (1)

Delete a vertex from a complete graph:

Scope  (8)

VertexDelete works with undirected graphs:

Directed graphs:

Multigraphs:

Mixed 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).

Text

Wolfram Research (2010), VertexDelete, Wolfram Language function, https://reference.wolfram.com/language/ref/VertexDelete.html (updated 2015).

CMS

Wolfram Language. 2010. "VertexDelete." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/VertexDelete.html.

APA

Wolfram Language. (2010). VertexDelete. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/VertexDelete.html

BibTeX

@misc{reference.wolfram_2024_vertexdelete, author="Wolfram Research", title="{VertexDelete}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/VertexDelete.html}", note=[Accessed: 22-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_vertexdelete, organization={Wolfram Research}, title={VertexDelete}, year={2015}, url={https://reference.wolfram.com/language/ref/VertexDelete.html}, note=[Accessed: 22-November-2024 ]}