incident:点与边关联
adjacent:点与点关联
loop: 环边
multipleedges:重边
simple graph:简单图,无loop和multipleedges
complete graph:完全图,任意两点都有连边的图
empty graph:空图
trivial graph:平凡图,边集为空,只有一个顶点的图
null graph:零图,边集和顶点集都为空的
degree:度
regular graph:正则图,各顶点的度一样
subgraph:子图
spanning subgraph:生成子图 v(H)=V(G)
induced subgraph:
edge-induced subgraph: