/индуциран подграф/

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.

Every graph is an induced subgraph of itself.