离散数学课件6.3 representing graphs and isomorphism.pptVIP

Section 6.3 Representing Graphs and Graph Isomorphism 图的表示和同形 Adjacency Matrices邻接矩阵，相邻矩阵 Suppose that G=(V,E) is a simple graph where |V|=n. Suppose that the vertices of G are listed arbitrarily as v1,v2,…vn. The adjacency matrix A (AG) of G,with respect to this listing of the vertices, is the n?n zero-one matrix ,where aij = 1 if there is an edge from vertex i to vertex j = 0 otherwise _______________ There are as many as n! different adjacency matrices for a graph with n vertices,since there are n! different orderings of n vertices. The adjacency matrix of a simple graph is symmetric, that is, aij=aji, since both of these entries are 1 when vi and vj are adjacent, and both are 0 otherwise. Furthermore, since a simple graph has no loops, each entries aii,i=1,2,3,…,n, is 0. In pseudographs伪图, aij = number of edges from vertex i to vertex j. A loop at the vertex i represented by a 1 at the (i,i)th position of the adjacency matrix. Examples: All undirected graphs, including multigraphs and pseudographs, have symmetric adjacency matrices. Let G=(V,E) be a directed graph, where v1,v2,…vn is an arbitrary listing of the vertices.If A=[aij], is the adjacency matrix for the directed graph with respect to this listing of the vertices,then aij=1 if (vi,vj) is an edge of G, =0 Example The adjacency matrix for a directed graph does not have to be symmetric不一定对称. In the adjacency matrix for a directed multigraph, aij equals the number of edges that are associated to (vi,vj). Incidence Matrices相连矩阵，关联矩阵 Let G=(V,E) be an undirected graph. Suppose that v1,v2,…vn are the vertices and e1,e2,…em are the edges of G. Then the incidence matrix with respect to this ordering of V and E is the n?m matrix M=[mij], where mij = 1 if edge ej is incident with vertex vi = 0 otherwise Note: this method requires labeling of edges. Only two 1s per column. Multiple edges are represented in the incidence matrix using columns with identical entries. Loops