Definition:Subgraph

A graph $$H=(V(H),E(H))$$ is called a subgraph of a graph $$G=(V(G),E(G))$$ if $$V(H)\subseteq V(G)$$ and $$E(H)\subseteq E(G)$$. That is to say, it contains no vertices or edges that are not in the original graph.