Induced Subgraph

graph-theory

Definition

Induced Subgraph

A subgraph $H=(V^{\prime },E^{\prime })$ of a graph $G=(V,E)$ is called an induced subgraph if it contains all edges from $E$ whose start and end nodes are included in $V^{\prime }$. That is, $E^{\prime }$ does not need to be explicitly specified but is induced by the specified but is induced by the specification of $G$ and $V^{\prime }$.