Connected Subgraph

A connected subgraph of a graph G is a subgraph of G that is a connected graph. A connected induced subgraph, more explicitly a connected vertex-induced subgraph, is a connected subgraph that contains every edge of G whose endpoints both lie in its vertex set. A connected subgraph need not be induced.

See also

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Connected Subgraph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ConnectedSubgraph.html

Subject classifications