一. 子图
(1)spanning subgraph(生成子图):Let G = (V, E) be a graph and H = (V’, E’) be a subgraph of G.The subgraph H is a spanning subgraph of G if V’ = V
(2)edge induced subgraph(边导出图):Let G = (V, E) be a graph. If E' belong to E, the subgraph of G induced by E’ is the graph H = (V’, E’) where v belong to V’ if and only if v appears in an edge in E’.
(3)vertex induced subgraph(点导出图):Let G = (V, E) be a graph. If V’ belong to V, V’ is not a empty set , The subgraph of G induced by V’ is the graph H = (V’, E’) where {v1, v2} belong to E’ if and only if v1 and v2 are both in V’.