《Discrete Mathematics II教学-华南理工》6.2 Graph terminology.pptVIP

Definition: If G1 and G2 are simple then G1 èG2 = (V1 è V2, E1 è E2) G1? G2 =(V1 ? V2, E1 ? E2) G1?G2 =(V1 ?V2,E1 ? E2), where E1 ? E2= (E1 ? E2)-(E1 ? E2) and the graph is simple. ________________ New Graphs from Old G1 G2 G1 ? G2 G1? G2 G1 ?G2 Example Note: The important properties of a graph do not depend on how we draw it. We want to be able to identify two graphs that are the same (up to labeling of the vertices). ________________ Section 6.2 Graph Terminology and special type of graphs April 19, 2011 Applied Discrete Mathematics Week 13: Graphs * Exercise A multigraph G with vertices V ={ } E= { }  a b c d 1 2 3 4 5 Solution: V= {a, b, c, d}, E={(a,b),(a,b),(b,c),(c,d),(c,d)} Undirected Graphs Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v. If e={u,v}, the edge e is called incident with the vertices u and v. The vertices u and v are called endpoints of e. Adjacent and incident Definition: The degree of a vertex v in an undirected graph is the number of edges incident with it, except that a loop at a vertex contribute twice to the degree of that vertex. The degree of the vertex v is denoted by deg(v). Degree ? If deg(v) = 0, v is called isolated. ? If deg(v) = 1, v is called pendant. d(v1)=4 d(v2)=4 d(v3)=3 d(v4)=1 d(v5)=0 Example April 19, 2011 Applied Discrete Mathematics Week 13: Graphs * Graph Terminology Which vertices in the following graph are isolated, which are pendant, and what is the maximum degree? What type of graph is it? Write the degree of each vertex? Solution: Vertex f is isolated, and vertices a, d and j are pendant. The maximum degree is deg(g) = 5. This graph is a pseudograph (undirected, loops). deg(a)=1, deg(b)=2, deg(c)=2, deg(d)=1, ). deg(e)=2, deg(f)=0, deg(g)=5,