《离散数学》杨争锋ch08-1幻灯片资料.pptVIP

Chapter 9 Graphs §9.1 Introduction to Graphs §9.2 Graph Terminology §9.3 Representing Graphs and Graph Isomorphism §9.4 Connectivity §9.5 Euler and Hamilton Paths §9.6 Shortest-Path Problems §9.7 Planar Graphs §9.8 Graph Coloring (3) Definition 3 (page 590) A pseudograph G=(V, E) consists of a set V of vertices, a set E of edges, and a function f from E to { {u,v} | u,v∈V }. An edge is a loop if f(e)={u,u}={u} for some u∈V. Example: See Figure 3 (page 590). (4) Definition 4 (page 591) A directed graph G=(V, E) consists of a set of vertices V and a set of edges E that ar