NeighborhoodSubgraph

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »

NeighborhoodSubgraph[g,i,r]

gives a subgraph consisting of vertices that can be reached from vertex i within r hops.

NeighborhoodSubgraph[g,i]

gives a subgraph consisting of vertices that can be reached from vertex i.

Details and Options

NeighborhoodSubgraph functionality is now available in the built-in Wolfram Language function NeighborhoodGraph.
To use NeighborhoodSubgraph, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
NeighborhoodSubgraph returns a subgraph consisting of vertices that can be reached from a given vertex within certain hops.

This defines a simple directed graph:

This finds a subgraph from vertices that can be reached from vertex 2 within 1 hop:

NeighborhoodSubgraph has been superseded by NeighborhoodGraph:

Top