An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in the Wolfram Language using Subgraph[g, elist].
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.