A subgraph G' of a graph G is a graph G' whose vertex set and edge set are subsets of those of G. If G' is a subgraph of G, then G is said to be a supergraph of G'. A vertex-induced subgraph, often simply called "an induced subgraph" of G induced by the vertex set V (where V is a subset of the vertex set of G) is the graph G' with vertex set V and edge set consisting of those edges both of whose endpoints are in V.

edge-induced subgraph | forbidden subgraph | graph | induced subgraph | subtree | supergraph | Ulam's conjecture | vertex-induced subgraph