induced subgraph
another graph, formed from a subset of the vertices of the graph and all of the edges connecting pairs of vertices in that subset
induced matching
graph theory term
independent set
set of vertices in a graph, no two of which are adjacent
clique
subset of the vertices of a node-link graph that are all adjacent to each other
induced path
graph path which is an induced subgraph
neighbourhood
subgraph made of all nodes linked to a given node of a graph