Definition talk:Spanning Subgraph

Concerning   template on this page -- it's indeed common to define a spanning subgraph as H, V(H) = V(G), where H and G are sub- and supergraphs respectively. It's also implied (since it is within a context of subgraph) that E(H) ⊆ E(G) (technically, an edgeless subgraph can be considered a spanning subgraph but it doesn't make much sense.) Thus, the definition doesn't address connectivity in general. It seems to be more of a convention to assume that, outside of additional context, a subgraph preserves componential properties of its super. Stixme (talk) 09:45, 22 January 2018 (EST)