Difference between revisions of "Graph Theory"
Line 6: | Line 6: | ||
{| class="wikitable" | {| class="wikitable" | ||
− | |[[File:graph_1 | + | |[[File:graph_1.png]] || [[File:graph_3.png]] |
|} | |} | ||
Line 39: | Line 39: | ||
There are many applications of graphs and associated algorithms that will not be included in this topic except for the Elementary Division. A Hamiltonian circuit is finding a path by which every vertex can be visited once and only once. An Euler circuit is finding a path by which every edge can be used once and only once. Graphs are traversable if there exists an Euler circuit unlike the famous Seven Bridges of Königsberg: | There are many applications of graphs and associated algorithms that will not be included in this topic except for the Elementary Division. A Hamiltonian circuit is finding a path by which every vertex can be visited once and only once. An Euler circuit is finding a path by which every edge can be used once and only once. Graphs are traversable if there exists an Euler circuit unlike the famous Seven Bridges of Königsberg: | ||
− | :::::[[File: | + | :::::[[File:konigsberg.png]] |
Rules of traversability show that vertices can be either odd or even based on how many edges are incident on it. A graph is traversable if there are 0 or 2 odd vertices. If there are 2 odd vertices, then the path must begin with one of them and end with the other. With no odd edges, the path can begin with any vertex in the graph. Conflict theory and proof of the Four Color Theorem also use principles of graph theory. | Rules of traversability show that vertices can be either odd or even based on how many edges are incident on it. A graph is traversable if there are 0 or 2 odd vertices. If there are 2 odd vertices, then the path must begin with one of them and end with the other. With no odd edges, the path can begin with any vertex in the graph. Conflict theory and proof of the Four Color Theorem also use principles of graph theory. | ||
Line 65: | Line 65: | ||
By using adjacency matrices, the current one is | By using adjacency matrices, the current one is | ||
− | + | ||
+ | [[File:matrix1_s2.png]] | ||
+ | |||
After adding edges AE and EA, the matrices are: | After adding edges AE and EA, the matrices are: | ||
+ | |||
+ | [[File:matrix2_s2.png]] | ||
There are 6 more paths of length 2 since 16 – 10 = 6. | There are 6 more paths of length 2 since 16 – 10 = 6. | ||
Line 79: | Line 83: | ||
Let matrix M represent the graph. Recall that the number of paths from vertex i to vertex j of length p equals M p[i,j]. The values of M, M 2 and M 4 are: | Let matrix M represent the graph. Recall that the number of paths from vertex i to vertex j of length p equals M p[i,j]. The values of M, M 2 and M 4 are: | ||
− | + | ||
+ | [[File:matrix_s3.png]] | ||
+ | |||
There is 1 path of length 2 (M 2[1,3]) and 3 paths of length 4 (M 4[1,3]). | There is 1 path of length 2 (M 2[1,3]) and 3 paths of length 4 (M 4[1,3]). | ||
Revision as of 07:47, 21 August 2018
Many problems are naturally formulated in terms of points and connections between them. For example, a computer network has PCs connected by cables, an airline map has cities connected by routes, and a school has rooms connected by hallways. A graph is a mathematical object which models such situations.
Contents
Overview
A graph is a collection of vertices and edges. An edge is a connection between two vertices (or nodes). One can draw a graph by marking points for the vertices and drawing lines connecting them for the edges, but it must be borne in mind that the graph is defined independently of the representation. For example, the following two drawings represent the same graph:
Terminology
The precise way to represent this graph is to identify its set of vertices {A, B, C, D, E, F, G, H, I, J, K, L, M}, and its set of edges between these vertices {AG, AB, AC, LM, JM, JL, JK, ED, FD, HI, FE, AF, GE}.
A path from vertex x to y in a graph is a list of vertices, in which successive vertices are connected by edges in the graph. For example, BAFEG is path from B to G in the graph above. A simple path is a path with no vertex repeated. For example, BAFEGAC is not a simple path.
A graph is connected if there is a path from every vertex to every other vertex in the graph. Intuitively, if the vertices were physical objects and the edges were strings connecting them, a connected graph would stay in one piece if picked up by any vertex. A graph which is not connected is made up of connected components. For example, the graph above has three connected components: {I, H}, {J, K, L, M} and {A, B, C, D, E, F, G}.
A cycle is a path, which is simple except that the first and last vertex are the same (a path from a point back to itself). For example, the path AFEGA is a cycle in our example. Vertices must be listed in the order that they are traveled to make the path; any of the vertices may be listed first. Thus, FEGAF and GAFEG are different ways to identify the same cycle. For clarity, we list the start / end vertex twice: once at the start of the cycle and once at the end.
We’ll denote the number of vertices in a given graph by V, the number of edges by E. Note that E can range anywhere from V to V2 (or 1/2 V(V-1) in an undirected graph). Graphs will all edges present are called complete graphs; graphs with relatively few edges present (say less than V log(V)) are called sparse; graphs with relatively few edges missing are called dense.
Trees
A graph with no cycles is called a tree. There is only one path between any two nodes in a tree. A tree on N vertices contains exactly N-1 edges. A spanning tree of a graph is a subgraph that contains all the vertices and forms a tree. A group of disconnected trees is called a forest.
Directed graphs are graphs which have a direction associated with each edge. An edge xy in a directed graph can be used in a path that goes from x to y but not necessarily from y to x. For example, a directed graph similar to our example graph is drawn below:
There is only one directed path from D to F. Note that there are two edges between H and I, one each direction, which essentially makes an undirected edge. An undirected graph can be thought of as a directed graph with all edges occurring in pairs in this way. A dag (directed acyclic graph) is a directed graph with no cycles.
Adjacency Matrices
It is frequently convenient to represent a graph by a matrix, as shown in the second sample problem below. If we consider vertex A as 1, B as 2, etc., then a “one” in M at row i and column j indicates that there is a path from vertex i to j. If we raise M to the pth power, the resulting matrix indicates which paths of length p exist in the graph. In fact, the quantity Mp(i,j) is the number of paths.
Traversability
There are many applications of graphs and associated algorithms that will not be included in this topic except for the Elementary Division. A Hamiltonian circuit is finding a path by which every vertex can be visited once and only once. An Euler circuit is finding a path by which every edge can be used once and only once. Graphs are traversable if there exists an Euler circuit unlike the famous Seven Bridges of Königsberg:
Rules of traversability show that vertices can be either odd or even based on how many edges are incident on it. A graph is traversable if there are 0 or 2 odd vertices. If there are 2 odd vertices, then the path must begin with one of them and end with the other. With no odd edges, the path can begin with any vertex in the graph. Conflict theory and proof of the Four Color Theorem also use principles of graph theory.
Sample Problems
Sample Problem 1
Find the number of different cycles contained in the directed graph with vertices {A, B, C, D, E} and edges {AB, BA, BC, CD, DC, DB, DE}.
Solution: The graph is as follows:
By inspection, the cycles are: {A,B}, {B,C,D} and {C,D}. Thus, there are 3 cycles in the graph.
Sample Problem 2
Given the directed graph below, how many more paths of length 3 would exist if edges AE and EA were added?
Solution:
By using adjacency matrices, the current one is
After adding edges AE and EA, the matrices are:
There are 6 more paths of length 2 since 16 – 10 = 6.
Sample Problem 3
In the following directed graph, find the total number of different paths from vertex A to vertex C of length 2 or 4.
Solution:
Let matrix M represent the graph. Recall that the number of paths from vertex i to vertex j of length p equals M p[i,j]. The values of M, M 2 and M 4 are:
There is 1 path of length 2 (M 2[1,3]) and 3 paths of length 4 (M 4[1,3]).
Sample Problem 4
Given the adjacency matrix, draw the directed graph.
Solution:
The vertices do not have to be in those exact locations, but the edges must be the same.
Video Resources
The following YouTube videos show ACSL students and advisors working out some ACSL problems that have appeared in previous contests. Some of the videos contain ads; ACSL is not responsible for the ads and does not receive compensation in any form for those ads.
Graph Theory (Intro) |