离散数学课件6.1graph and graph model.pptVIP

Section 6.1 Introduction to Graphs图的简介 Section 6.1 Introduction to Graphs Graphs are discrete structures consisting of vertices and edges that connect these vertices. Graph theory is an old subject with many modern applications. Its basic ideas were introduced in the eighteenth century by the great Swiss mathematician Leonhard Euler. Types of graphs Undirected Graphs无向图 Definition A simple graph简单图 G=(V,E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. - no arrows - no loops - cant have multiple edges joining vertices Example Simple graph Definition A multigraph 多重图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,u?v}. The edges e1 and e2 are called multiple or parallel edges if f(e1)=f(e2). ? A multigraph allows multiple edges for two vertices - redundancy in networks Example: Definition 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 edges is a loop if f(e1)={u,u}={u} for some u ?V ? A pseudograph is a multigraph which permits loops. _______________ Example: Directed Graphs有向图 ? Directed graph (V, E) - single directed edges between vertices Definition A directed graph (V,E) consists of a set of vertices V and a set of edges E that are ordered pairs of elements of V. Loops, ordered pairs of the same element are allowed. multiple edges in the same direction between two vertices are not allowed. ? Directed multigraph 有向多重图- multiple directed edges between vertices Definition A directed graph (V,E) consists of a set of vertices V and a set E of edges, and a function f from E to {{u,v}|u,v ?V}. The edges e1 and e2 are multiple edges if f(e1)=f(e2). ____________________ _ Examples: A directed graph A directed multigraph Graph Model Example Niche Overlap Graph in Ecology 凹重叠生态图 Acquaintanceship graph 熟人关系图 Influence graph 影响图 The Hollywood Graph (sect