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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.