离散数学课件(英文版)Graph.pptVIP

Graphs Lecture 9 Discrete Mathematical Structures Problem of “Crossing River” Problem: A person(P), a wolf(W), a lamb(L) and a cabbage(C) will cross a river by a boat which can carry any two of them once. Wolf and lamb, or, lamb and cabbage, cannot stay together without the person present. Remember that only the person can run the boat. Seven Bridges at K?nigsberg Abstraction Vertices representing objects - areas Edges representing the relationship between objects – connected by a bridge Graph and Diagram Graph G is a triple: G =〈VG, EG, ?〉 VG and EG are sets，satisgying VG?EG=?, ?:EG?{{vi, vj}| vi, vj?VG} Note: {vi, vj}={vj, vi} A graph can be represented conveniently by some diagram: : each element of VG as a dot, the vertex, and each element of EG as a line segment, the edge, between two vertices. So, VG is called the set of vertices, and EG, the set of edges. Relations in Graph Relation defined from edge set to the Cartesian product of vertex set Incidence Relation defined on the set of vertices Adjacency Considering the relations above, a graph can be represented by matrix. Simple Graph Multiple edges and ring If ? is not a injection, that is, exist ei, ej?EG, ei?ej, but ?(ei)=?(ej), then ei, ej是are called multiple edges.。 For any ei?EG, if ?(ei)={vi, vi}={vi}, then ei is called a ring. Simple graph A graph without ring and multiple edges is called a simple graph. Degree of Vertex Degree of vertex dG(v) = number of edge incident to v dG(v) must be a nonnegative integer. Numerical characteristics of the degree of vertex Sum of degree of all vertices in a graph is even. m is the number of edges in the graph. The number of vertices with odd degree must be even. Complete Graph A graph is a complete graph if and only if any two of its vertices are adjacent. In the sense of isomorphism, for a given n, there is exactly one complete graph, denoted as Kn, where n is the number of vertices in the graph. In Kn, for any v