图论_Graph Theory.pptxVIP

图论 Graph Theory;1.1 图和简单图 1.2 图的同构 1.3 关联矩阵和邻接矩阵 1.4 子图 1.5 顶点的度 1.6 路和连通 1.7 圈 1.8 最短路问题;Graph: An ordered triple (V(G), E(G), Y(G)). V(G): A nonempty set of vertices. E(G): A set of edges. YG : An incidence function. Associates each edge of G with an unordered pair of vertices of G. Loop: An edge with identical ends Link: An edge with distinct ends Simple Graph: A graph with no loops and no two of its links join the same pair of vertices. e = uv. n(G): the number of vertices in graph G. e(G): the number of edges in graph G.;Identical graph: Two graphs G and H are identical if V(G) = V(H), E(G) = E(H) and YG = YH. Isomorphic graph: ?q : V(G) →V(H) and f : E(G) → E(H) such that YG(e)=uv ? YH(e)= q (u) q (v). (q , f): isomorphism Complete graph: a simple graph in which any two vertices are adjacent. 完全图 Empty graph: no two vertices are adjacent (edge set is empty) 空图 A graph is bipartite if its vertex set can be partitioned into two subsets X and Y so that every edge has one end in X and one end in Y. (X,Y) is called a bipartition of the graph. G[X,Y ].偶图和二分部 Complete bipartite graph: G[X,Y] is simple and every vertex in X is joined to every vertex in Y. 完全偶图;Incidence matrix (关联矩阵) of G: n×e matrix M(G):= (mij), where mij is the number of times (0, 1, 2) that vi and ej are incident. Adjacency matrix (邻接矩阵) of G: n×n matrix A(G):= (aij), where aij is the number of edges joining vi and vj. ;A graph H is called a subgraph of a graph G if V(H) ? V (G), E(H) ? E(G), and YH is the restriction of YG to E(H). When H ? G but H ≠ G, H ? G and H is a proper subgraph of G. A spanning subgraph of a graph G is a subgraph obtained by edge deletions only (a subgraph whose vertex set is the entire vertex set of G). By deleting from a graph G all loops and, for every pair of adjacent vertices, all but one link joining them, we obtain a simple spanning subgraph called the underlying simple graph of G. Up to isomorphism, each graph has a unique underlying simple graph.基础简单图;Induce