## About

A set S of edges is spanning for a graph G if, for every edge {x, y} of G, there is an x-to-y path consisting of edges of S.

ie for each edge xy in G, there is an x-to-y path consisting of edges of S.

See also: Linear Algebra - Span of a Vector Space