Subgraph

The induced subgraph of g on the given vertices.

✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram LanguageSubgraph✓↗

Subgraph(g, vertices)those vertices (in $g$'s order), and every edge of $g$ with both endpoints among them.

Typed signatures

Type	Package	Applies
(value, list<any>) -> value	combinatorics	always

Domain: Collections

Examples

Basic #

The induced subgraph on 3 of $K_4$'s vertices is $K_3$

live ↗

In$\mathrm{Subgraph}(\mathrm{CompleteGraph}(4), \bigl\lbrack1, 2, 3\bigr\rbrack)$Out$\mathrm{Graph}(\bigl\lbrack1, 2, 3\bigr\rbrack, \bigl\lbrack\mathrm{UndirectedEdge}(1, 2), \mathrm{UndirectedEdge}(1, 3), \mathrm{UndirectedEdge}(2, 3)\bigr\rbrack)$

About

Examples	1
Checked against	Wolfram Language 1 agree
Crosswalk	Wolfram Language

See also: NeighborhoodGraph, Graph