In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges, from the original graph, connecting pairs of vertices in that subset.

Definition

Formally, let be any graph, and let be any subset of vertices of . Then the induced subgraph is the graph whose vertex set

3.Next