# Chapter 6: Graph Theory

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance. Some examples of routing problems are routes covered by postal workers, UPS drivers, police officers, garbage disposal personnel, water meter readers, census takers, tour buses, etc. Some examples of network problems are telephone networks, railway systems, canals, roads, pipelines, and computer chips. Section 6.1: Graph Theory There are several definitions that are important to understand before delving into Graph Theory. They are: A graph is a picture of dots called vertices and lines called edges. An edge that starts and ends at the same vertex is called a loop. If there are two or more edges directly connecting the same two vertices, then these edges are called multiple edges. If there is a way to get from one vertex of a graph to all the other vertices of the graph, then the graph is connected. If there is even one vertex of a graph that cannot be reached from every other vertex, then the graph is disconnected. Example 6.1.1: Graph Example 1 Figure 6.1.1: Graph 1 In the above graph, the vertices are U, V, W, and Z and the edges are UV, VV, VW, UW, WZ1, and WZ2. This is a connected graph. VV is a loop. WZ1, and WZ2 are multiple edges. Page 197

2 Example 6.1.2: Graph Example 2 Figure 6.1.2: Graph 2 Figure 6.1.3: Graph 3 The graph in Figure is connected while the graph in Figure is disconnected. Graph Concepts and Terminology: Order of a Network: the number of vertices in the entire network or graph Adjacent Vertices: two vertices that are connected by an edge Adjacent Edges: two edges that share a common vertex Degree of a Vertex: the number of edges at that vertex Path: a sequence of vertices with each vertex adjacent to the next one that starts and ends at different vertices and travels over any edge only once Circuit: a path that starts and ends at the same vertex Bridge: an edge such that if it were removed from a connected graph, the graph would become disconnected Example 6.1.3: Graph Terminology Figure 6.1.4: Graph 4 In the above graph the following is true: Page 198

3 Vertex A is adjacent to vertex B, vertex C, vertex D, and vertex E. Vertex F is adjacent to vertex C, and vertex D. Edge DF is adjacent to edge BD, edge AD, edge CF, and edge DE. The degrees of the vertices: A 4 B 4 C 4 D 4 E 4 F 2 Here are some paths in the above graph: (there are many more than listed) A,B,D A,B,C,E F,D,E,B,C Here are some circuits in the above graph: (there are many more than listed) B,A,D,B B,C,F,D,B F,C, E, D, F The above graph does not have any bridges. Section 6.2: Networks A network is a connection of vertices through edges. The internet is an example of a network with computers as the vertices and the connections between these computers as edges. Spanning Subgraph: a graph that joins all of the vertices of a more complex graph, but does not create a circuit Page 199

4 Example 6.2.1: Spanning Subgraph Figure 6.2.1: Map of Connecting Towns This is a graph showing how six cities are linked by roads. This graph has many spanning subgraphs but two examples are shown below. Figure 6.2.2: Spanning Subgraph 1 This graph spans all of the cities (vertices) of the original graph, but does not contain any circuits. Figure 6.2.3: Spanning Subgraph 2 Page 200

5 This graph spans all of the cities (vertices) of the original graph, but does not contain any circuits. Tree: A tree is a graph that is connected and has no circuits. Therefore, a spanning subgraph is a tree and the examples of spanning subgraphs in Example above are also trees. Properties of Trees: 1. If a graph is a tree, there is one and only one path joining any two vertices. Conversely, if there is one and only one path joining any two vertices of a graph, the graph must be a tree. 2. In a tree, every edge is a bridge. Conversely, if every edge of a connected graph is a bridge, then the graph must be a tree. 3. A tree with N vertices must have N-1 edges. 4. A connected graph with N vertices and N-1 edges must be a tree. Example 6.2.2: Tree Properties Figure 6.2.2: Spanning Subgraph 1 Consider the spanning subgraph highlighted in green shown in Figure a. Tree Property 1 Look at the vertices Appleville and Heavytown. Since the graph is a tree, there is only one path joining these two cities. Also, since there is only one path between any two cities on the whole graph, then the graph must be a tree. b. Tree Property 2 Since the graph is a tree, notice that every edge of the graph is a bridge, which is an edge such that if it were removed the graph would become disconnected. Page 201

6 c. Tree Property 3 Since the graph is a tree and it has six vertices, it must have N 1 or six 1 = five edges. d. Tree Property 4 Since the graph is connected and has six vertices and five edges, it must be a tree. Example 6.2.3: More Examples of Trees: All of the graphs shown below are trees and they all satisfy the tree properties. Figure 6.2.4: More Examples of Trees Minimum Spanning Tree: A minimum spanning tree is the tree that spans all of the vertices in a problem with the least cost (or time, or distance). Page 202

7 Example 6.2.4: Minimum Spanning Tree Figure 6.2.5: Weighted Graph 1 The above is a weighted graph where the numbers on each edge represent the cost of each edge. We want to find the minimum spanning tree of this graph so that we can find a network that will reach all vertices for the least total cost. Figure 6.2.6: Minimum Spanning Tree for Weighted Graph 1 This is the minimum spanning tree for the graph with a total cost of 51. Page 203

8 Kruskal s Algorithm: Since some graphs are much more complicated than the previous example, we can use Kruskal s Algorithm to always be able to find the minimum spanning tree for any graph. 1. Find the cheapest link in the graph. If there is more than one, pick one at random. Mark it in red. 2. Find the next cheapest link in the graph. If there is more than one, pick one at random. Mark it in red. 3. Continue doing this as long as the next cheapest link does not create a red circuit. 4. You are done when the red edges span every vertex of the graph without any circuits. The red edges are the MST (minimum spanning tree). Example 6.2.5: Using Kruskal s Algorithm Figure 6.2.7: Weighted Graph 2 Suppose that it is desired to install a new fiber optic cable network between the six cities (A, B, C, D, E, and F) shown above for the least total cost. Also, suppose that the fiber optic cable can only be installed along the roadways shown above. The weighted graph above shows the cost (in millions of dollars) of installing the fiber optic cable along each roadway. We want to find the minimum spanning tree for this graph using Kruskal s Algorithm. Page 204

9 Step 1: Find the cheapest link of the whole graph and mark it in red. The cheapest link is between B and C with a cost of four million dollars. Figure 6.2.8: Kruskal s Algorithm Step 1 Step 2: Find the next cheapest link of the whole graph and mark it in red. The next cheapest link is between A and C with a cost of six million dollars. Figure 6.2.9: Kruskal s Algorithm Step 2 Page 205

10 Step 3: Find the next cheapest link of the whole graph and mark it in red as long as it does not create a red circuit. The next cheapest link is between C and E with a cost of seven million dollars. Figure : Kruskal s Algorithm Step 3 Step 4: Find the next cheapest link of the whole graph and mark it in red as long as it does not create a red circuit. The next cheapest link is between B and D with a cost of eight million dollars. Figure : Kruskal s Algorithm Step 4 Page 206

11 Step 5: Find the next cheapest link of the whole graph and mark it in red as long as it does not create a red circuit. The next cheapest link is between A and B with a cost of nine million dollars, but that would create a red circuit so we cannot use it. Therefore, the next cheapest link after that is between E and F with a cost of 12 million dollars, which we are able to use. We cannot use the link between C and D which also has a cost of 12 million dollars because it would create a red circuit. Figure : Kruskal s Algorithm Step 5 This was the last step and we now have the minimum spanning tree for the weighted graph with a total cost of \$37,000,000. Section 6.3: Euler Circuits Leonhard Euler first discussed and used Euler paths and circuits in Rather than finding a minimum spanning tree that visits every vertex of a graph, an Euler path or circuit can be used to find a way to visit every edge of a graph once and only once. This would be useful for checking parking meters along the streets of a city, patrolling the streets of a city, or delivering mail. Euler Path: a path that travels through every edge of a connected graph once and only once and starts and ends at different vertices Page 207

12 Example 6.3.1: Euler Path Figure 6.3.1: Euler Path Example One Euler path for the above graph is F, A, B, C, F, E, C, D, E as shown below. Figure 6.3.2: Euler Path This Euler path travels every edge once and only once and starts and ends at different vertices. This graph cannot have an Euler circuit since no Euler path can start and end at the same vertex without crossing over at least one edge more than once. Page 208

13 Euler Circuit: an Euler path that starts and ends at the same vertex Example 6.3.2: Euler Circuit Figure 6.3.3: Euler Circuit Example One Euler circuit for the above graph is E, A, B, F, E, F, D, C, E as shown below. Figure 6.3.4: Euler Circuit This Euler path travels every edge once and only once and starts and ends at the same vertex. Therefore, it is also an Euler circuit. Page 209

14 Euler s Theorems: Euler s Theorem 1: If a graph has any vertices of odd degree, then it cannot have an Euler circuit. If a graph is connected and every vertex has an even degree, then it has at least one Euler circuit (usually more). Euler s Theorem 2: If a graph has more than two vertices of odd degree, then it cannot have an Euler path. If a graph is connected and has exactly two vertices of odd degree, then it has at least one Euler path (usually more). Any such path must start at one of the odd-degree vertices and end at the other one. Euler s Theorem 3: The sum of the degrees of all the vertices of a graph equals twice the number of edges (and therefore must be an even number). Therefore, the number of vertices of odd degree must be even. Finding Euler Circuits: 1. Be sure that every vertex in the network has even degree. 2. Begin the Euler circuit at any vertex in the network. 3. As you choose edges, never use an edge that is the only connection to a part of the network that you have not already visited. 4. Label the edges in the order that you travel them and continue this until you have travelled along every edge exactly once and you end up at the starting vertex. Example 6.3.3: Finding an Euler Circuit Figure 6.3.5: Graph for Finding an Euler Circuit Page 210

15 The graph shown above has an Euler circuit since each vertex in the entire graph is even degree. Thus, start at one even vertex, travel over each vertex once and only once, and end at the starting point. One example of an Euler circuit for this graph is A, E, A, B, C, B, E, C, D, E, F, D, F, A. This is a circuit that travels over every edge once and only once and starts and ends in the same place. There are other Euler circuits for this graph. This is just one example. Figure 6.3.6: Euler Circuit The degree of each vertex is labeled in red. The ordering of the edges of the circuit is labeled in blue and the direction of the circuit is shown with the blue arrows. Section 6.4 Hamiltonian Circuits The Traveling Salesman Problem (TSP) is any problem where you must visit every vertex of a weighted graph once and only once, and then end up back at the starting vertex. Examples of TSP situations are package deliveries, fabricating circuit boards, scheduling jobs on a machine and running errands around town. Page 211

16 Hamilton Circuit: a circuit that must pass through each vertex of a graph once and only once Hamilton Path: a path that must pass through each vertex of a graph once and only once Example 6.4.1: Hamilton Path: Figure 6.4.1: Examples of Hamilton Paths a. b. c. Not all graphs have a Hamilton circuit or path. There is no way to tell just by looking at a graph if it has a Hamilton circuit or path like you can with an Euler circuit or path. You must do trial and error to determine this. By the way if a graph has a Hamilton circuit then it has a Hamilton path. Just do not go back to home. Graph a. has a Hamilton circuit (one example is ACDBEA) Graph b. has no Hamilton circuits, though it has a Hamilton path (one example is ABCDEJGIFH) Graph c. has a Hamilton circuit (one example is AGFECDBA) Complete Graph: A complete graph is a graph with N vertices in which every pair of vertices is joined by exactly one edge. The symbol used to denote a complete graph is KN. Page 212

17 Example 6.4.2: Complete Graphs Figure 6.4.2: Complete Graphs for N = 2, 3, 4, and 5 a. K2 b. K3 c. K4 d. K5 two vertices and one edge three vertices and three edges four vertices and six edges five vertices and ten edges In each complete graph shown above, there is exactly one edge connecting each pair of vertices. There are no loops or multiple edges in complete graphs. Complete graphs do have Hamilton circuits. Reference Point: the starting point of a Hamilton circuit Example 6.4.3: Reference Point in a Complete Graph Many Hamilton circuits in a complete graph are the same circuit with different starting points. For example, in the graph K3, shown below in Figure 6.4.3, ABCA is the same circuit as BCAB, just with a different starting point (reference point). We will typically assume that the reference point is A. Figure 6.4.3: K3 A C B Page 213

18 Number of Hamilton Circuits: A complete graph with N vertices is (N-1)! Hamilton circuits. Since half of the circuits are mirror images of the other half, there are actually only half this many unique circuits. Example 6.4.4: Number of Hamilton Circuits How many Hamilton circuits does a graph with five vertices have? (N 1)! = (5 1)! = 4! = 4*3*2*1 = 24 Hamilton circuits. How to solve a Traveling Salesman Problem (TSP): A traveling salesman problem is a problem where you imagine that a traveling salesman goes on a business trip. He starts in his home city (A) and then needs to travel to several different cities to sell his wares (the other cities are B, C, D, etc.). To solve a TSP, you need to find the cheapest way for the traveling salesman to start at home, A, travel to the other cities, and then return home to A at the end of the trip. This is simply finding the Hamilton circuit in a complete graph that has the smallest overall weight. There are several different algorithms that can be used to solve this type of problem. A. Brute Force Algorithm 1. List all possible Hamilton circuits of the graph. 2. For each circuit find its total weight. 3. The circuit with the least total weight is the optimal Hamilton circuit. Example 6.4.5: Brute Force Algorithm: Figure 6.4.4: Complete Graph for Brute Force Algorithm Page 214

19 Suppose a delivery person needs to deliver packages to three locations and return to the home office A. Using the graph shown above in Figure 6.4.4, find the shortest route if the weights on the graph represent distance in miles. Recall the way to find out how many Hamilton circuits this complete graph has. The complete graph above has four vertices, so the number of Hamilton circuits is: (N 1)! = (4 1)! = 3! = 3*2*1 = 6 Hamilton circuits. However, three of those Hamilton circuits are the same circuit going the opposite direction (the mirror image). Hamilton Circuit Mirror Image Total Weight (Miles) ABCDA ADCBA 18 ABDCA ACDBA 20 ACBDA ADBCA 20 The solution is ABCDA (or ADCBA) with total weight of 18 mi. This is the optimal solution. B. Nearest-Neighbor Algorithm: 1. Pick a vertex as the starting point. 2. From the starting point go to the vertex with an edge with the smallest weight. If there is more than one choice, choose at random. 3. Continue building the circuit, one vertex at a time from among the vertices that have not been visited yet. 4. From the last vertex, return to the starting point. Example 6.4.6: Nearest-Neighbor Algorithm A delivery person needs to deliver packages to four locations and return to the home office A as shown in Figure below. Find the shortest route if the weights represent distances in miles. Starting at A, E is the nearest neighbor since it has the least weight, so go to E. From E, B is the nearest neighbor so go to B. From B, C is the nearest neighbor so go to C. From C, the first nearest neighbor is B, but you just came from there. The next nearest neighbor is A, but you do not want to go there yet because that is the starting point. The next nearest neighbor is E, but you already went there. So go to D. From D, go to A since all other vertices have been visited. Page 215

20 Figure 6.4.5: Complete Graph for Nearest-Neighbor Algorithm The solution is AEBCDA with a total weight of 26 miles. This is not the optimal solution, but it is close and it was a very efficient method. C. Repetitive Nearest-Neighbor Algorithm: 1. Let X be any vertex. Apply the Nearest-Neighbor Algorithm using X as the starting vertex and calculate the total cost of the circuit obtained. 2. Repeat the process using each of the other vertices of the graph as the starting vertex. 3. Of the Hamilton circuits obtained, keep the best one. If there is a designated starting vertex, rewrite this circuit with that vertex as the reference point. Example 6.4.7: Repetitive Nearest-Neighbor Algorithm Suppose a delivery person needs to deliver packages to four locations and return to the home office A. Find the shortest route if the weights on the graph represent distances in kilometers. Page 216

21 Figure 6.4.6: Complete Graph for Repetitive Nearest-Neighbor Algorithm Starting at A, the solution is AEBCDA with total weight of 26 miles as we found in Example See this solution below in Figure Figure 6.4.7: Starting at A Page 217

22 Starting at B, the solution is BEDACB with total weight of 20 miles. Figure 6.4.8: Starting at B Starting at C, the solution is CBEDAC with total weight of 20 miles. Figure 6.4.9: Starting at C Page 218

23 Starting at D, the solution is DEBCAD with total weight of 20 miles. Figure : Starting at D Starting at E, solution is EBCADE with total weight of 20 miles. Figure : Starting at E Page 219

24 Now, you can compare all of the solutions to see which one has the lowest overall weight. The solution is any of the circuits starting at B, C, D, or E since they all have the same weight of 20 miles. Now that you know the best solution using this method, you can rewrite the circuit starting with any vertex. Since the home office in this example is A, let s rewrite the solutions starting with A. Thus, the solution is ACBEDA or ADEBCA. D. Cheapest-Link Algorithm 1. Pick the link with the smallest weight first (if there is a tie, randomly pick one). Mark the corresponding edge in red. 2. Pick the next cheapest link and mark the corresponding edge in red. 3. Continue picking the cheapest link available. Mark the corresponding edge in red except when a) it closes a circuit or b) it results in three edges coming out of a single vertex. 4. When there are no more vertices to link, close the red circuit. Example 6.4.8: Cheapest-Link Algorithm Figure : Complete Graph for Cheapest-Link Algorithm Suppose a delivery person needs to deliver packages to four locations and return to the home office A. Find the shortest route if the weights represent distances in miles. Page 220

25 Step 1: Find the cheapest link of the graph and mark it in blue. The cheapest link is between B and E with a weight of one mile. Figure : Step 1 Step 2: Find the next cheapest link of the graph and mark it in blue. The next cheapest link is between B and C with a weight of two miles. Figure : Step 2 Page 221

26 Step 3: Find the next cheapest link of the graph and mark it in blue provided it does not make a circuit or it is not a third edge coming out of a single vertex. The next cheapest link is between D and E with a weight of three miles. Figure : Step 3 Step 4: Find the next cheapest link of the graph and mark it in blue provided it does not make a circuit or it is not a third edge coming out of a single vertex. The next cheapest link is between A and E with a weight of four miles, but it would be a third edge coming out of a single vertex. The next cheapest link is between A and C with a weight of five miles. Mark it in blue. Figure : Step 4 Page 222

27 Step 5: Since all vertices have been visited, close the circuit with edge DA to get back to the home office, A. This is the only edge we could close the circuit with because AB creates three edges coming out of vertex B and BD also created three edges coming out of vertex B. Figure : Step 5 The solution is ACBEDA or ADEBCA with total weight of 20 miles. Efficient Algorithm: an algorithm for which the number of steps needed to carry it out grows in proportion to the size of the input to the problem. Approximate Algorithm: any algorithm for which the number of steps needed to carry it out grows in proportion to the size of the input to the problem. There is no known algorithm that is efficient and produces the optimal solution. Page 223

28 Chapter 6 Homework 1. Answer the following questions based on the graph below. a. What are the vertices? b. Is this graph connected? c. What is the degree of vertex C? d. Edge FE is adjacent to which edges? e. Does this graph have any bridges? 2. Answer the following questions based on the graph below. a. What are the vertices? b. What is the degree of vertex u? c. What is the degree of vertex s? d. What is one circuit in the graph? Page 224

29 3. Draw a spanning subgraph in the graph below. 4. Find the minimum spanning tree in the graph below using Kruskal s Algorithm. Page 225

30 5. Find the minimum spanning tree in the graph below using Kruskal s Algorithm. 6. Find an Euler Path in the graph below. 7. Find an Euler circuit in the graph below. Page 226

31 8. Which graphs below have Euler Paths? Which graphs have Euler circuits? 9. Highlight an Euler circuit in the graph below. 10. For each of the graphs below, write the degree of each vertex next to each vertex. Page 227

32 11. Circle whether each of the graphs below has an Euler circuit, an Euler path, or neither. a. Euler circuit b. Euler path c. Neither a. Euler circuit b. Euler path c. Neither a. Euler circuit b. Euler path c. Neither 12. How many Hamilton circuits does a complete graph with 6 vertices have? 13. Suppose you need to start at A, visit all three vertices, and return to the starting point A. Using the Brute Force Algorithm, find the shortest route if the weights represent distances in miles. Page 228

33 14. If a graph is connected and, the graph will have an Euler circuit. a. the graph has an even number of vertices b. the graph has an even number of edges c. the graph has all vertices of even degree d. the graph has only two odd vertices 15. Starting at vertex A, use the Nearest-Neighbor Algorithm to find the shortest route if the weights represent distances in miles. 16. Find a Hamilton circuit using the Repetitive Nearest-Neighbor Algorithm. Page 229

34 17. Find a Hamilton circuit using the Cheapest-Link Algorithm. 18. Which is a circuit that traverses each edge of the graph exactly once? A. Euler circuit b. Hamilton circuit c. Minimum Spanning Tree 19. Which is a circuit that traverses each vertex of the graph exactly once? A. Euler circuit b. Hamilton circuit c. Minimum Spanning Tree 20. For each situation, would you find an Euler circuit or a Hamilton Circuit? a. The department of Public Works must inspect all streets in the city to remove dangerous debris. b. Relief food supplies must be delivered to eight emergency shelters located at different sites in a large city. c. The Department of Public Works must inspect traffic lights at intersections in the city to determine which are still working. d. An insurance claims adjuster must visit 11 homes in various neighborhoods to write reports. Page 230

### MGF 1107 CH 15 LECTURE NOTES Denson. Section 15.1

1 Section 15.1 Consider the house plan below. This graph represents the house. Consider the mail route below. This graph represents the mail route. 2 Definitions 1. Graph a structure that describes relationships.

### Graph Theory. Euler tours and Chinese postmen. John Quinn. Week 5

Graph Theory Euler tours and Chinese postmen John Quinn Week 5 Recap: connectivity Connectivity and edge-connectivity of a graph Blocks Kruskal s algorithm Königsberg, Prussia The Seven Bridges of Königsberg

### Solutions to Exercises 8

Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.

### Planar Graph and Trees

Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning

### MATHEMATICAL THOUGHT AND PRACTICE. Chapter 7: The Mathematics of Networks The Cost of Being Connected

MATHEMATICAL THOUGHT AND PRACTICE Chapter 7: The Mathematics of Networks The Cost of Being Connected Network A network is a graph that is connected. In this context the term is most commonly used when

V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

### Euler Paths and Euler Circuits

Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and

### Math 443/543 Graph Theory Notes 4: Connector Problems

Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we

### Chapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

9 Properties of Trees. Definitions: Chapter 4: Trees forest - a graph that contains no cycles tree - a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

### Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

### CSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: Graphs. The Internet graph

Today s Topics: CSE 0: Discrete Mathematics for Computer Science Prof. Miles Jones. Graphs. Some theorems on graphs. Eulerian graphs Graphs! Model relations between pairs of objects The Internet graph!

### (a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from

4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called

### Graph. Consider a graph, G in Fig Then the vertex V and edge E can be represented as:

Graph A graph G consist of 1. Set of vertices V (called nodes), (V = {v1, v2, v3, v4...}) and 2. Set of edges E (i.e., E {e1, e2, e3...cm} A graph can be represents as G = (V, E), where V is a finite and

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry 2.1 Steiner Tree Definition 2.1.1 In the Steiner Tree problem the input

### Chapter 4. Trees. 4.1 Basics

Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.

### Minimum Spanning Trees

Minimum Spanning Trees Algorithms and 18.304 Presentation Outline 1 Graph Terminology Minimum Spanning Trees 2 3 Outline Graph Terminology Minimum Spanning Trees 1 Graph Terminology Minimum Spanning Trees

### Basic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by

Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn

### Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

### CMSC 451: Graph Properties, DFS, BFS, etc.

CMSC 451: Graph Properties, DFS, BFS, etc. Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Based on Chapter 3 of Algorithm Design by Kleinberg & Tardos. Graphs

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### Trees and Fundamental Circuits

Trees and Fundamental Circuits Tree A connected graph without any circuits. o must have at least one vertex. o definition implies that it must be a simple graph. o only finite trees are being considered

### COLORED GRAPHS AND THEIR PROPERTIES

COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring

### 1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT

DECISION 1 Revision Notes 1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT Make sure you show comparisons clearly and label each pass First Pass 8 4 3 6 1 4 8 3 6 1 4 3 8 6 1 4 3 6 8 1

### 1 Digraphs. Definition 1

1 Digraphs Definition 1 Adigraphordirected graphgisatriplecomprisedofavertex set V(G), edge set E(G), and a function assigning each edge an ordered pair of vertices (tail, head); these vertices together

### Artificial Intelligence Methods (G52AIM)

Artificial Intelligence Methods (G52AIM) Dr Rong Qu rxq@cs.nott.ac.uk Constructive Heuristic Methods Constructive Heuristics method Start from an empty solution Repeatedly, extend the current solution

### 1 Basic Definitions and Concepts in Graph Theory

CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered

### Homework 15 Solutions

PROBLEM ONE (Trees) Homework 15 Solutions 1. Recall the definition of a tree: a tree is a connected, undirected graph which has no cycles. Which of the following definitions are equivalent to this definition

### Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh

Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh Graph Theory: Graph theory can be defined as the study of graphs; Graphs are mathematical structures used to model pair-wise relations between

### Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.

Mária Markošová Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency. Isomorphism of graphs. Paths, cycles, trials.

### Chinese postman problem

PTR hinese postman problem Learning objectives fter studying this chapter, you should be able to: understand the hinese postman problem apply an algorithm to solve the problem understand the importance

### Networks! Topics in Contemporary Mathematics! MA 103! Summer II, 2013!

1! Networks! Topics in Contemporary Mathematics! MA 103! Summer II, 2013! 2! Content Trees Spanning Trees Kruskal s Algorithm The Shortest Network Connecting Three Points Shortest Networks for Four or

### Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902

Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties

### Graphs and Network Flows IE411 Lecture 1

Graphs and Network Flows IE411 Lecture 1 Dr. Ted Ralphs IE411 Lecture 1 1 References for Today s Lecture Required reading Sections 17.1, 19.1 References AMO Chapter 1 and Section 2.1 and 2.2 IE411 Lecture

### GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### The TSP is a special case of VRP, which means VRP is NP-hard.

49 6. ROUTING PROBLEMS 6.1. VEHICLE ROUTING PROBLEMS Vehicle Routing Problem, VRP: Customers i=1,...,n with demands of a product must be served using a fleet of vehicles for the deliveries. The vehicles,

### Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C

### 14. Trees and Their Properties

14. Trees and Their Properties This is the first of a few articles in which we shall study a special and important family of graphs, called trees, discuss their properties and introduce some of their applications.

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### The Mathematics of Networks (Chapter 7)

The Mathematics of Networks (Chapter 7) We have studied how to visit all the edges of a graph (via an Euler path or circuit) and how to visit all the vertices (via a Hamilton circuit). The Mathematics

### Chapter 6 Planarity. Section 6.1 Euler s Formula

Chapter 6 Planarity Section 6.1 Euler s Formula In Chapter 1 we introduced the puzzle of the three houses and the three utilities. The problem was to determine if we could connect each of the three utilities

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with

### Lecture Notes on Spanning Trees

Lecture Notes on Spanning Trees 15-122: Principles of Imperative Computation Frank Pfenning Lecture 26 April 26, 2011 1 Introduction In this lecture we introduce graphs. Graphs provide a uniform model

### Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:

1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph

About the Tutorial This tutorial offers a brief introduction to the fundamentals of graph theory. Written in a reader-friendly style, it covers the types of graphs, their properties, trees, graph traversability,

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson)

Chapter 11 Graph Theory The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson) (N. Let us start with a formal definition of what is a graph. Definition 72. A graph

### The relationship of a trees to a graph is very important in solving many problems in Maths and Computer Science

Trees Mathematically speaking trees are a special class of a graph. The relationship of a trees to a graph is very important in solving many problems in Maths and Computer Science However, in computer

### Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.

Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics

### A tree can be defined in a variety of ways as is shown in the following theorem: 2. There exists a unique path between every two vertices of G.

7 Basic Properties 24 TREES 7 Basic Properties Definition 7.1: A connected graph G is called a tree if the removal of any of its edges makes G disconnected. A tree can be defined in a variety of ways as

### Counting Spanning Trees

Counting Spanning Trees Bang Ye Wu Kun-Mao Chao Counting Spanning Trees This book provides a comprehensive introduction to the modern study of spanning trees. A spanning tree for a graph G is a subgraph

### Determining If Two Graphs Are Isomorphic 1

Determining If Two Graphs Are Isomorphic 1 Given two graphs, it is often really hard to tell if they ARE isomorphic, but usually easier to see if they ARE NOT isomorphic. Here is our first idea to help

### Geometry Unit 1. Basics of Geometry

Geometry Unit 1 Basics of Geometry Using inductive reasoning - Looking for patterns and making conjectures is part of a process called inductive reasoning Conjecture- an unproven statement that is based

### Homework 13 Solutions. X(n) = 3X(n 1) + 5X(n 2) : n 2 X(0) = 1 X(1) = 2. Solution: First we find the characteristic equation

Homework 13 Solutions PROBLEM ONE 1 Solve the recurrence relation X(n) = 3X(n 1) + 5X(n ) : n X(0) = 1 X(1) = Solution: First we find the characteristic equation which has roots r = 3r + 5 r 3r 5 = 0,

### MATHEMATICS Unit Decision 1

General Certificate of Education January 2007 Advanced Subsidiary Examination MATHEMATICS Unit Decision 1 MD01 Tuesday 16 January 2007 9.00 am to 10.30 am For this paper you must have: an 8-page answer

### SAMPLES OF HIGHER RATED WRITING: LAB 5

SAMPLES OF HIGHER RATED WRITING: LAB 5 1. Task Description Lab report 5. (April 14) Graph Coloring. Following the guidelines, and keeping in mind the assessment criteria, using where appropriate experimental

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Chapter There are non-isomorphic rooted trees with four vertices. Ans: 4.

Use the following to answer questions 1-26: In the questions below fill in the blanks. Chapter 10 1. If T is a tree with 999 vertices, then T has edges. 998. 2. There are non-isomorphic trees with four

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### Long questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and -3B.

Unit-1: Matrix Algebra Short questions answer 1. What is Matrix? 2. Define the following terms : a) Elements matrix b) Row matrix c) Column matrix d) Diagonal matrix e) Scalar matrix f) Unit matrix OR

### Answers to some of the exercises.

Answers to some of the exercises. Chapter 2. Ex.2.1 (a) There are several ways to do this. Here is one possibility. The idea is to apply the k-center algorithm first to D and then for each center in D

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### Section Summary. Introduction to Graphs Graph Taxonomy Graph Models

Chapter 10 Chapter Summary Graphs and Graph Models Graph Terminology and Special Types of Graphs Representing Graphs and Graph Isomorphism Connectivity Euler and Hamiltonian Graphs Shortest-Path Problems

### 3. Eulerian and Hamiltonian Graphs

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

### Graph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis

Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.0, steen@cs.vu.nl Chapter 06: Network analysis Version: April 8, 04 / 3 Contents Chapter

### Sum of Degrees of Vertices Theorem

Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2

### Jefferson s Method. Hamilton s Method is fair until the surplus allocation, and then some states get preferential treatment.

1 Jefferson s Method Hamilton s Method is fair until the surplus allocation, and then some states get preferential treatment. Remove issue of surplus seats. Jefferson s Method: Step 1: Modify divisor D

### Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

### The Classes P and NP. mohamed@elwakil.net

Intractable Problems The Classes P and NP Mohamed M. El Wakil mohamed@elwakil.net 1 Agenda 1. What is a problem? 2. Decidable or not? 3. The P class 4. The NP Class 5. TheNP Complete class 2 What is a

### Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes

Math 340 Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes Name (Print): This exam contains 6 pages (including this cover page) and 5 problems. Enter all requested information on the top of this page,

### UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

### Graph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis. Contents. Introduction. Maarten van Steen. Version: April 28, 2014

Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R.0, steen@cs.vu.nl Chapter 0: Version: April 8, 0 / Contents Chapter Description 0: Introduction

### Section 6.4 Closures of Relations

Section 6.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of ordered pairs to R to obtain property P. In

### 1. Relevant standard graph theory

Color identical pairs in 4-chromatic graphs Asbjørn Brændeland I argue that, given a 4-chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4-coloring

### Notes on Matrix Multiplication and the Transitive Closure

ICS 6D Due: Wednesday, February 25, 2015 Instructor: Sandy Irani Notes on Matrix Multiplication and the Transitive Closure An n m matrix over a set S is an array of elements from S with n rows and m columns.

### 5. GRAPHS ON SURFACES

. GRPHS ON SURCS.. Graphs graph, by itself, is a combinatorial object rather than a topological one. But when we relate a graph to a surface through the process of embedding we move into the realm of topology.

### CHAPTER 2 GRAPHS F G C D

page 1 of Section 2.1 HPTR 2 GRPHS STION 1 INTROUTION basic terminology graph is a set of finitely many points called vertices which may be connected by edges. igs 1 3 show three assorted graphs. v1 v2

### NP-Completeness. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University

NP-Completeness CptS 223 Advanced Data Structures Larry Holder School of Electrical Engineering and Computer Science Washington State University 1 Hard Graph Problems Hard means no known solutions with

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should

### (Knight) 3 : A Graphical Perspective of the Knight's Tour on a Multi-Layered Chess Board

Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-2-2016 (Knight) 3 : A Graphical Perspective of the Knight's

### CS5314 Randomized Algorithms. Lecture 16: Balls, Bins, Random Graphs (Random Graphs, Hamiltonian Cycles)

CS5314 Randomized Algorithms Lecture 16: Balls, Bins, Random Graphs (Random Graphs, Hamiltonian Cycles) 1 Objectives Introduce Random Graph Model used to define a probability space for all graphs with

### CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.

Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure

### HOMEWORK #3 SOLUTIONS - MATH 3260

HOMEWORK #3 SOLUTIONS - MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not

### 12. Visibility Graphs and 3-Sum Lecture on Monday 9 th

12. Visibility Graphs and 3-Sum Lecture on Monday 9 th November, 2009 by Michael Homann 12.1 Sorting all Angular Sequences. Theorem 12.1 Consider a set P of n points in the plane.

### A permutation can also be represented by describing its cycles. What do you suppose is meant by this?

Shuffling, Cycles, and Matrices Warm up problem. Eight people stand in a line. From left to right their positions are numbered,,,... 8. The eight people then change places according to THE RULE which directs

### There are 8000 registered voters in Brownsville, and 3 8. of these voters live in

Politics and the political process affect everyone in some way. In local, state or national elections, registered voters make decisions about who will represent them and make choices about various ballot

### Introduction to computer science

Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.

### Geometry 1. Unit 3: Perpendicular and Parallel Lines

Geometry 1 Unit 3: Perpendicular and Parallel Lines Geometry 1 Unit 3 3.1 Lines and Angles Lines and Angles Parallel Lines Parallel lines are lines that are coplanar and do not intersect. Some examples

### Page 1. CSCE 310J Data Structures & Algorithms. CSCE 310J Data Structures & Algorithms. P, NP, and NP-Complete. Polynomial-Time Algorithms

CSCE 310J Data Structures & Algorithms P, NP, and NP-Complete Dr. Steve Goddard goddard@cse.unl.edu CSCE 310J Data Structures & Algorithms Giving credit where credit is due:» Most of the lecture notes

### Example 5.5. The heuristics are demonstrated with this example of n=5 vertices and distances in the following matrix:

39 5.3. HEURISTICS FOR THE TSP Notation: f = length of the tour given by the algortihm a f = length of the optimal tour min Most of the following heuristics are designed to solve symmetric instances of

### Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

### Planarity Planarity

Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?