subgraph

A graph made from some of another graph's vertices and edges.

In more detail

A spanning tree is a subgraph that keeps every vertex but only enough edges to connect them without cycles. Every tree drawn from a graph's edges is a subgraph of it.

Related terms

Taught in

References