An induced subgraph is a subgraph obtained from an original graph by removing a subset of vertices and/or edges together with any edges whose
endpoints are both in this subset or any vertices that are their endpoints, respectively.
Note that the nonspecific term "induced subgraph" is commonly used to mean
More things to try:
Weisstein, Eric W. "Induced Subgraph."
From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/InducedSubgraph.html