NeighborhoodGraph

The induced subgraph on the vertices within distance n of v (underlying graph).

Wolfram LanguageNeighborhoodGraph↗

NeighborhoodGraph(g, v)distance $\leq 1$ (v and its immediate neighbours).

NeighborhoodGraph(g, v, n)distance $\leq n$, by BFS on the underlying (direction-blind) graph.

Typed signatures

Type	Package	Applies
(value, any, integer?) -> value	combinatorics	always

Domain: Collections

Examples

Basic #

Default radius 1 around the middle of a 7-vertex path

live ↗

In$\mathrm{VertexList}(\mathrm{NeighborhoodGraph}(\mathrm{PathGraph}(7), 4))$Out$\bigl\lbrack3, 4, 5\bigr\rbrack$

live ↗

In$\mathrm{VertexList}(\mathrm{NeighborhoodGraph}(\mathrm{PathGraph}(7), 4, 2))$Out$\bigl\lbrack2, 3, 4, 5, 6\bigr\rbrack$

About

Examples	2
Crosswalk	Wolfram Language

See also: Subgraph, GraphDistance