Compuing Fundamentals 2Lecture 1A Theory of Graphs.ppt

Computing Fundamentals 2Lecture 1 A Theory of Graphs Lecturer: Patrick Browne p.dit.ie/pbrowne/ Room K408 Based on Chapter 19. A Logical approach to Discrete Math By David Gries and Fred B. Schneider A Theory of Graphs We all have an intuitive understanding of graphs. A Theory of Graphs Some terminology In graph theory term, the dots on the map are called vertices and the lines that connect the vertices are called edges. We have labelled the edges e1..e13. If we travel from Newport to Cork we call this a path from Newport to Cork. The graph can be written as: G = V,E V = {Newport, Sligo, Athlone, Drogheda, Dublin, Carlow, Waterford, Cork, Limerick, Galway} E = {e1, e2, … e13} This is an undirected graph, there are no one-way streets. Rephrasing the question Question: Starting at Newport is it possible to travel each road exactly once and return to Newport? Our problem can be restated: Is there a path from vertex Newport to vertex Newport that traverses each edge exactly once? Reasoning about the question Suppose there was such a path consider the vertex Limerick. Each time we arrive at Limerick on some edge , we must leave using a different edge. Furthermore, every edge that touches Limerick must be used. Reasoning about the question Thus the edges at Limerick occur in in/out pairs. It follows that an even number of edges must touch Limerick. Since three edges touch Limerick (e6,e9,e11) we have a contraction. Therefore, there is no path from Newport to Newport that traverses every edge once. We have proved this using graph theory. Algorithms in proofs An algorithm is a finite list of well-defined instructions for accomplishing some task that, given an initial state, will proceed through a well-defined series of successive states, possibly eventually terminating in an end-state1. The proof of some results in graph theory may involve an algorithm to construct some object like a path from one vertex to another. In Chapter 19 of Gries and Schneider algorithms a