Category:Definitions/Subgraphs

This category contains definitions related to Subgraphs.
Related results can be found in Category:Subgraphs.

A graph $H = \struct {\map V H, \map E H}$ is called a subgraph of a graph $G = \struct {\map V G, \map E G}$ if and only if $\map V H \subseteq \map V G$ and $\map E H \subseteq \map E G$.

That is to say, it contains no vertices or edges that are not in the original graph.