edge-induced subgraph

edge-induced subgraph

[¦ej in‚düst ′səb‚graf]
(mathematics)
A subgraph whose vertices consist of all the vertices in the original graph that are incident on at least one edge in the subgraph.