Graph Theory Euler Paths图论欧拉路径. University of Hawaii at .pptVIP

Graph Theory: Euler Circuits Christina Mende Math 480 April 15, 2013 Preliminaries A graph is a pair G=(V,E) of sets satisfying The elements of V are the vertices of our graph. The elements of E are the edges of our graph. a b c d V={a,b,c,d} E={{a,b},{a,c},{b,c},{c,d}} Preliminaries The degree of a vertex v (denoted deg(v))is the number of edges directly connected to that vertex. a b c d V={a,b,c,d} E={{a,b},{a,c},{b,c},{c,d}} deg(a)=2 deg(b)=2 deg(c)=3 deg(d)=1 Preliminaries A path of length n0 is a sequence of edges that begins at a vertex of the graph and travels from vertex to vertex