By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy
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].
graph minor | induced subgraph | subgraph | vertex-induced subgraph
Back to List | POWERED BY THE WOLFRAM LANGUAGE