vertex-induced graph

vertex-induced graph

[¦vər‚teks in‚düst ′graf] (mathematics) A subgraph whose edges consist of all the edges in the original graph that join pairs of vertices in the subgraph. Also known as induced subgraph.