10.2 Graph Terminology 图的术语
Undirected Graph G=(V,E) 无向图
-
Vertex ,edge
-
adjacent(neighbors)
若{u,v}是无向图G的边,则两个顶点u和v称为在无向图G里邻接(相邻)。
-
incident with u and v
边e称为关联点u和v,也可以说边e连接u和v。
-
endpoints
u和v称作边{u,v}的端点
-
loop
-
degree of vertex
无向图中,顶点的度是与该顶点关联的边的数目
Notation :deg(v)
if deg(v)=0,v is called isolated 孤立的
if deg(v)=1,v is called pendant 悬挂的
Theorem 1 The Handshaking Theorem 握手理论
Let G=(V,E) be an undirected graph G with e edges. Then
$$
\sum_{v\in V}{deg(v)=2e}
$$
多重边和环这个式子也成立,环给顶点提供两个度。
Theorem 2
An undirected graph has an even number of vertices of odd degree.
无向图有偶数个奇数度顶点
Driected Graphs G=(V.E)
-
起点 initial vertex 终点 terminal vertex
Let {u.v} be an edge in G. Then u is an initial vertex and is adjacent to v and v is a terminal vertex and is adjacent to u
-
入度 in degree
The in degree of a vertex v , denoted deg-(v) is the number of edges which terminate at v.
-
出度 out degree
the out degree of a vertex v ,denoted deg+(v) is the number of edges which initiate at v.
Theorem 3
Let G=(V,E) be a graph with direct edges.Then
$$
\sum_{v\in V}deg+(v)=\sum_{v\in V}deg-(v)=|E|
$$
在带有向边的图里,所有顶点的入度之和等于出度之和。这两个和都等于图的边数
Some Special Simple Graphs 一些特殊的简单图
Compelete Graphs 完全图-K_n:
the simple graph with
-
n vertices
-
exactly one edge between ever pair of distinct vertices.The graphs K_n for n=1,2,3,4,5.
Cycles 圈图C_n(n>2)
C_n is an vertex graph which is a cycle.
Wheels 轮图W_n (n>2)
给圈图加一个顶点和其他n个顶点逐个相连
n-Cubes Q_n n立方体
相邻两顶点位串只差一位
Bipartite Graph 偶图
把简单图G的顶点集分为两个永不相交的非空集合V1,V2,每条边都连着一个V1和一个V2里的顶点
Compelete Bipartite Graph 完全偶图 (分别有m,n个顶点的子图)
m中的每个顶点与n中的每个顶点都有边
类似于满射
Regular Graph 正则图
所有的点度数都一样
Some New Graph From Old
子图和生成子图
Definition G=(V,E). H=(W,F)
-
当WV,F E ,H 是 G 的子图 subgraph
-
当W=V,FE, H 是 G 的生成子图 spanning subgraph
边、点导出子图
定义
设G为一个图,E_1 E(G),以E_1为边集,E_1中边的所有端点为顶点集构成的子图叫G的边导出子图。记作G(E_1).
设G为一个图,V_1 E(V),以V_1为顶点集,端点均在V_1中的边的全体为边集构成的子图叫G的点导出子图。记作G(V_1).
注意
顶点导出子图不一定是边导出子图
含有孤立点的顶点导出子图,不能由任何边的子集导出
边导出子集不一定是顶点导出子集
边导出子集可能与顶点导出子集相比,可能会缺几条边
补图
设G为具有n个顶点的简单图,从完全图K_n中删去所有G中的边,但保留所有G中顶点所形成的图称为G的补图,记作~G。
图的并 union