# Lecture Notes on GRAPH THEORY Tero Harju

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Lecture Notes on GRAPH THEORY Tero Harju Department of Mathematics University of Turku FIN Turku, Finland

2 Contents 1 Introduction Graphs and their plane figures Subgraphs Paths and cycles Connectivity of Graphs Bipartite graphs and trees Connectivity Tours and Matchings Eulerian graphs Hamiltonian graphs Matchings Colourings Edge colourings Ramsey Theory Vertex colourings Graphs on Surfaces Planar graphs Colouring planar graphs Genus of a graph Directed Graphs Digraphs Network Flows Index

3 1 Introduction Graph theory may be said to have its beginning in 1736 when EULER considered the (general case of the) Königsberg bridge problem: Does there exist a walk crossing each of the seven bridges of Königsberg exactly once? (Solutio Problematis ad geometriam situs pertinentis, Commentarii Academiae Scientiarum Imperialis Petropolitanae 8 (1736), pp ) It took 200 years before the first book on graph theory was written. This was Theorie der endlichen und unendlichen Graphen ( Teubner, Leipzig, 1936) by KÖNIG in Since then graph theory has developed into an extensive and popular branch of mathematics, which has been applied to many problems in mathematics, computer science, and other scientific and not-so-scientific areas. For the history of early graph theory, see N.L. BIGGS, R.J. LLOYD AND R.J. WILSON, Graph Theory , Clarendon Press, There are no standard notations for graph theoretical objects. This is natural, because the names one uses for the objects reflect the applications. Thus, for instance, if we consider a communications network (say, for ) as a graph, then the computers taking part in this network, are called nodes rather than vertices or points. On the other hand, other names are used for molecular structures in chemistry, flow charts in programming, human relations in social sciences, and so on. These lectures study finite graphs and majority of the topics is included in J.A. BONDY, U.S.R. MURTY, Graph Theory with Applications, Macmillan, R. DIESTEL, Graph Theory, Springer-Verlag, F. HARARY, Graph Theory, Addison-Wesley, D.B. WEST, Introduction to Graph Theory, Prentice Hall, R.J. WILSON, Introduction to Graph Theory, Longman, (3rd ed.) In these lectures we study combinatorial aspects of graphs. For more algebraic topics and methods, see N. BIGGS, Algebraic Graph Theory, Cambridge University Press, (2nd ed.) C. GODSIL, G.F. ROYLE, Algebraic Graph Theory, Springer, and for computational aspects, see S. EVEN, Graph Algorithms, Computer Science Press, 1979.

4 In these lecture notes we mention several open problems that have gained respect among the researchers. Indeed, graph theory has the advantage that it contains easily formulated open problems that can be stated early in the theory. Finding a solution to any one of these problems is another matter. Sections with a star ( ) in their heading are optional. Notations and notions For a finite set X, X denotes its size (cardinality, the number of its elements). Let [1, n] = {1, 2,..., n}, and in general, [i, n] = {i, i+ 1,..., n} for integers i n. For a real number x, the floor and the ceiling of x are the integers x = max{k Z k x} and x = min{k Z x k}. A family {X 1, X 2,..., X k } of subsets X i X of a set X is a partition of X, if X = X i and X i X j = for all different i and j. i [1,k] For two sets X and Y, is their Cartesian product, and X Y = {(x, y) x X, y Y} X Y = (X\ Y) (Y\X) is their symmetric difference. Here X\ Y = {x x X, x / Y}. Two integers n, k N (often n = X and k = Y for sets X and Y) have the same parity, if both are even, or both are odd, that is, if n k (mod 2). Otherwise, they have opposite parity. Graph theory has abundant examples of NP-complete problems. Intuitively, a problem is in P 1 if there is an efficient (practical) algorithm to find a solution to it. On the other hand, a problem is in NP 2, if it is first efficient to guess a solution and then efficient to check that this solution is correct. It is conjectured (and not known) that P = NP. This is one of the great problems in modern mathematics and theoretical computer science. If the guessing in NP-problems can be replaced by an efficient systematic search for a solution, then P=NP. For any one NP-complete problem, if it is in P, then necessarily P=NP. 1 Solvable by an algorithm in polynomially many steps on the size of the problem instances. 2 Solvable nondeterministically in polynomially many steps on the size of the problem instances. 3

5 1.1 Graphs and their plane figures Graphs and their plane figures Let V be a finite set, and denote by E(V) = {{u, v} u, v V, u = v}. the 2-sets of V, i.e., subsets of two distinct elements. DEFINITION. A pair G = (V, E) with E E(V) is called a graph (on V). The elements of V are the vertices of G, and those of E the edges of G. The vertex set of a graph G is denoted by V G and its edge set by E G. Therefore G = (V G, E G ). In literature, graphs are also called simple graphs; vertices are called nodes or points; edges are called lines or links. The list of alternatives is long (but still finite). A pair{u, v} is usually written simply as uv. Notice that then uv = vu. In order to simplify notations, we also write v G and e G instead of v V G and e E G. DEFINITION. For a graph G, we denote ν G = V G and ε G = E G. The number ν G of the vertices is called the order of G, and ε G is the size of G. For an edge e = uv G, the vertices u and v are its ends. Vertices u and v are adjacent or neighbours, if uv G. Two edges e 1 = uv and e 2 = uw having a common end, are adjacent with each other. A graph G can be represented as a plane figure by drawing a line (or a curve) between the points u and v (representing vertices) if e = uv is an edge of G. The figure on the right is a geometric representation of the graph G with V G = {v 1, v 2, v 3, v 4, v 5, v 6 } and E G = {v 1 v 2, v 1 v 3, v 2 v 3, v 2 v 4, v 5 v 6 }. v 1 v 2 v 3 v 6 v 4 v 5 Often we shall omit the identities (names v) of the vertices in our figures, in which case the vertices are drawn as anonymous circles. Graphs can be generalized by allowing loops vv and parallel (or multiple) edges between vertices to obtain a multigraph G = (V, E, ψ), where E = {e 1, e 2,..., e m } is a set (of symbols), and ψ : E E(V) {vv v V} is a function that attaches an unordered pair of vertices to each e E: ψ(e) = uv. Note that we can have ψ(e 1 ) = ψ(e 2 ). This is drawn in the figure of G by placing two (parallel) edges that connect the common ends. On the right there is (a drawing of) a multigraph G with vertices V = {a, b, c} and edges ψ(e 1 ) = aa, ψ(e 2 ) = ab, ψ(e 3 ) = bc, and ψ(e 4 ) = bc. b a c

6 1.1 Graphs and their plane figures 5 Later we concentrate on (simple) graphs. DEFINITION. We also study directed graphs or digraphs D = (V, E), where the edges have a direction, that is, the edges are ordered: E V V. In this case, uv = vu. The directed graphs have representations, where the edges are drawn as arrows. A digraph can contain edges uv and vu of opposite directions. Graphs and digraphs can also be coloured, labelled, and weighted: DEFINITION. A function α : V G K is a vertex colouring of G by a set K of colours. A function α : E G K is an edge colouring of G. Usually, K = [1, k] for some k 1. If K R (often K N), then α is a weight function or a distance function. Isomorphism of graphs DEFINITION. Two graphs G and H are isomorphic, denoted by G = H, if there exists a bijection α : V G V H such that uv E G α(u)α(v) E H for all u, v G. Hence G and H are isomorphic if the vertices of H are renamings of those of G. Two isomorphic graphs enjoy the same graph theoretical properties, and they are often identified. In particular, all isomorphic graphs have the same plane figures (excepting the identities of the vertices). This shows in the figures, where we tend to replace the vertices by small circles, and talk of the graph although there are, in fact, infinitely many such graphs. Example 1.1. The following graphs are isomorphic. Indeed, the required isomorphism v 2 v is given by v 1 1, v 2 3, v 5 1 v 3 4, v 4 2, v 5 5. v 1 v Isomorphism Problem. Does there exist an efficient algorithm to check whether any two given graphs are isomorphic or not? The following table lists the number 2 (n 2 ) of all graphs on a given set of n vertices, and the number of all nonisomorphic graphs on n vertices. It tells that at least for computational purposes an efficient algorithm for checking whether two graphs are isomorphic or not would be greatly appreciated. n graphs > nonisomorphic

7 1.1 Graphs and their plane figures 6 Other representations Plane figures catch graphs for our eyes, but if a problem on graphs is to be programmed, then these figures are, to say the least, unsuitable. Integer matrices are ideal for computers, since every respectable programming language has array structures for these, and computers are good in crunching numbers. Let V G = {v 1,..., v n } be ordered. The adjacency matrix of G is the n n-matrix M with entries M ij = 1 or M ij = 0 according to whether v i v j G or v i v j / G. For instance, the graph in Example 1.1 has an adjacency matrix on the right. Notice that the adjacency matrix is always symmetric (with respect to its diagonal consisting of zeros) A graph has usually many different adjacency matrices, one for each ordering of its set V G of vertices. The following result is obvious from the definitions. Theorem 1.1. Two graphs G and H are isomorphic if and only if they have a common adjacency matrix. Moreover, two isomorphic graphs have exactly the same set of adjacency matrices. Graphs can also be represented by sets. For this, let X = {X 1, X 2,..., X n } be a family of subsets of a set X, and define the intersection graph G X as the graph with vertices X 1,..., X n, and edges X i X j for all i and j (i = j) with X i X j =. Theorem 1.2. Every graph is an intersection graph of some family of subsets. Proof. Let G be a graph, and define, for all v G, a set X v = {{v, u} vu G}. Then X u X v = if and only if uv G. Let s(g) be the smallest size of a base set X such that G can be represented as an intersection graph of a family of subsets of X, that is, s(g) = min{ X G = G X for somex 2 X }. How small can s(g) be compared to the order ν G (or the size ε G ) of the graph? It was shown by KOU, STOCKMEYER AND WONG (1976) that it is algorithmically difficult to determine the number s(g) the problem is NP-complete. Example 1.2. As yet another example, let A N be a finite set of natural numbers, and let G A = (A, E) be the graph with rs E if and only if r and s (for r = s) have a common divisor > 1. As an exercise, we state: All graphs can be represented in the form G A for some set A of natural numbers.

8 1.2 Subgraphs Subgraphs Ideally, given a nice problem the local properties of a graph determine a solution. In these situations we deal with (small) parts of the graph (subgraphs), and a solution can be found to the problem by combining the information determined by the parts. For instance, as we shall later see, the existence of an Euler tour is very local, it depends only on the number of the neighbours of the vertices. Degrees of vertices DEFINITION. Let v G be a vertex a graph G. The neighbourhood of v is the set N G (v) = {u G vu G}. The degree of v is the number of its neighbours: d G (v) = N G (v). If d G (v) = 0, then v is said to be isolated in G, and if d G (v) = 1, then v is a leaf of the graph. The minimum degree and the maximum degree of G are defined as δ(g) = min{d G (v) v G} and (G) = max{d G (v) v G}. The following lemma, due to EULER (1736), tells that if several people shake hands, then the number of hands shaken is even. Lemma 1.1 (Handshaking lemma). For each graph G, d G (v) = 2 ε G. v G Moreover, the number of vertices of odd degree is even. Proof. Every edge e E G has two ends. The second claim follows immediately from the first one. Lemma 1.1 holds equally well for multigraphs, when d G (v) is defined as the number of edges that have v as an end, and when each loop vv is counted twice. Note that the degrees of a graph G do not determine G. Indeed, there are graphs G = (V, E G ) and H = (V, E H ) on the same set of vertices that are not isomorphic, but for which d G (v) = d H (v) for all v V.

9 1.2 Subgraphs 8 Subgraphs DEFINITION. A graph H is a subgraph of a graph G, denoted by H G, if V H V G and E H E G. A subgraph H G spans G (and H is a spanning subgraph of G), if every vertex of G is in H, i.e., V H = V G. Also, a subgraph H G is an induced subgraph, if E H = E G E(V H ). In this case, H is induced by its set V H of vertices. In an induced subgraph H G, the set E H of edges consists of all e E G such that e E(V H ). To each nonempty subset A V G, there corresponds a unique induced subgraph G[A] = (A, E G E(A)). To each subset F E G of edges there corresponds a unique spanning subgraph of G, G[F] = (V G, F). G subgraph spanning induced For a set F E G of edges, let G F = G[E G \ F] be the subgraph of G obtained by removing (only) the edges e F from G. In particular, G e is obtained from G by removing e G. Similarly, we write G+F, if each e F (for F E(V G )) is added to G. For a subset A V G of vertices, we let G A G be the subgraph induced by V G \ A, that is, G A = G[V G \ A], and, e.g., G v is obtained from G by removing the vertex v together with the edges that have v as their end. Reconstruction Problem. The famous open problem, Kelly-Ulam problem or the Reconstruction Conjecture, states that a graph of order at least 3 is determined up to isomorphism by its vertex deleted subgraphs G v (v G): if there exists a bijection α : V G V H such that G v = H α(v) for all v, then G = H.

10 1.2 Subgraphs 9 2-switches DEFINITION. For a graph G, a 2-switch with respect to the edges uv, xy G with ux, vy / G replaces the edges uv and xy by ux and vy. Denote v y v y G 2s H if there exists a finite sequence of 2-switches that carries G to H. Note that if G 2s H then also H 2s G since we can apply the sequence of 2- switches in reverse order. Before proving Berge s switching theorem we need the following tool. Lemma 1.2. Let G be a graph of order n with a degree sequence d 1 d 2 d n, where d G (v i ) = d i. Then there is a graph G such that G 2s G with N G (v 1 ) = {v 2,..., v d1 +1}. Proof. Let d = (G) (= d 1 ). Suppose that there is a vertex v i with 2 i d+1 such that v 1 v i / G. Since d G (v 1 ) = d, there exists a v j with j d+2 such that v 1 v j G. Here d i d j, since j > i. Since v 1 v j G, there exists a v t (2 t n) such that v 1 v i v j v i v t G, but v j v t / G. We can now perform a 2-switch with respect to the vertices v 1, v j, v i, v t. This gives a new v t graph H, where v 1 v i H and v 1 v j / H, and the other neighbours of v 1 remain to be its neighbours. When we repeat this process for all indices i with v 1 v i / G for 2 i d+1, we obtain a graph G as required. Theorem 1.3 (BERGE (1973)). Two graphs G and H on a common vertex set V satisfy d G (v) = d H (v) for all v V if and only if H can be obtained from G by a sequence of 2-switches. Proof. If G 2s H, then clearly H has the same degrees as G. In converse, we use induction on the order ν G. Let G and H have the same degrees. By Lemma 1.2, we have a vertex v and graphs G and H such that G 2s G and 2s H H with N G (v) = N H (v). Now the graphs G v and H v have the same degrees. By the induction hypothesis, G v 2s H v, and thus also G 2s H. Finally, we observe that H 2s H by the reverse 2-switches, and this proves the claim. DEFINITION. Let d 1, d 2,..., d n be a descending sequence of nonnegative integers, that is, d 1 d 2 d n. Such a sequence is said to be graphical, if there exists a graph G = (V, E) with V = {v 1, v 2,..., v n } such that d i = d G (v i ) for all i. u x u x

11 1.2 Subgraphs 10 Using the next result recursively one can decide whether a sequence of integers is graphical or not. Theorem 1.4 (HAVEL (1955), HAKIMI (1962)). A sequence d 1, d 2,..., d n (with d 1 1 and n 2) is graphical if and only if d 2 1, d 3 1,..., d d1 +1 1, d d1 +2, d d1 +3,..., d n (1.1) is graphical (when put into nonincreasing order). Proof. ( ) Consider G of order n 1 with vertices (and degrees) d G (v 2 ) = d 2 1,..., d G (v d1 +1) = d d1 +1 1, d G (v d1 +2) = d d1 +2,..., d G (v n ) = d n as in (1.1). Add a new vertex v 1 and the edges v 1 v i for all i [2, d d1 +1]. Then in the new graph H, d H (v 1 ) = d 1, and d H (v i ) = d i for all i. ( ) Assume d G (v i ) = d i. By Lemma 1.2 and Theorem 1.3, we can suppose that N G (v 1 ) = {v 2,..., v d1 +1}. But now the degree sequence of G v 1 is in (1.1). Example 1.3. Consider the sequence s = 4, 4, 4, 3, 2, 1. By Theorem 1.4, s is graphical 3, 3, 2, 1, 1 is graphical 2, 1, 1, 0 is graphical v 2 v 4 0, 0, 0 is graphical. v 6 The last sequence corresponds to a graph with no edges, and hence also our original sequence s is graphical. Indeed, the graph G on the right has this degree sequence. v 1 v 3 v 5 Special graphs DEFINITION. A graph G = (V, E) is trivial, if it has only one vertex, i.e., ν G = 1; otherwise G is nontrivial. The graph G = K V is the complete graph on V, if every two vertices are adjacent: E = E(V). All complete graphs of order n are isomorphic with each other, and they will be denoted by K n. The complement of G is the graph G on V G, where E G = {e E(V) e / E G }. The complements G = K V of the complete graphs are called discrete graphs. In a discrete graph E G =. Clearly, all discrete graphs of order n are isomorphic with each other. A graph G is said to be regular, if every vertex of G has the same degree. If this degree is equal to r, then G is r-regular or regular of degree r.

12 1.3 Paths and cycles 11 A discrete graph is 0-regular, and a complete graph K n is (n 1)-regular. In particular, ε Kn = n(n 1)/2, and therefore ε G n(n 1)/2 for all graphs G that have order n. Many problems concerning (induced) subgraphs are algorithmically difficult. For instance, to find a maximal complete subgraph (a subgraph K m of maximum order) of a graph is unlikely to be even in NP. Example 1.4. The graph on the right is the Petersen graph that we will meet several times (drawn differently). It is a 3-regular graph of order 10. Example 1.5. Let k 1 be an integer, and consider the set B k of all binary strings of length k. For instance, B 3 = {000, 001, 010, 100, 011, 101, 110, 111}. Let Q k be the graph, called the k-cube, with V Qk = B k, where uv Q k if and only if the strings u and v differ in exactly one place. The order of Q k is ν Qk = 2 k, the number of binary strings of length k. Also, Q k is k-regular, and so, by the handshaking lemma, ε Qk = k 2 k 1. On the right we have the 3-cube, or simply the cube Example 1.6. Let n 4 be any even number. We show by induction that there exists a 3-regular graph G with ν G = n. Notice that all 3-regular graphs have even order by the handshaking lemma. If n = 4, then K 4 is 3-regular. Let G be a 3-regular graph of order 2m 2, and suppose that uv, uw E G. Let V H = V G {x, y}, and E H = (E G \ {uv, uw}) {ux, xv, uy, yw, xy}. Then H is 3-regular of order 2m. x w u 001 y v Paths and cycles The most fundamental notions in graph theory are practically oriented. Indeed, many graph theoretical questions ask for optimal solutions to problems such as: find a shortest path (in a complex network) from a given point to another. This kind of problems can be difficult, or at least nontrivial, because there are usually choices what branch to choose when leaving an intermediate point. Walks DEFINITION. Let e i = u i u i+1 G be edges of G for i [1, k]. The sequence W = e 1 e 2... e k is a walk of length k from u 1 to u k+1. Here e i and e i+1 are compatible in the sense that e i is adjacent to e i+1 for all i [1, k 1].

13 1.3 Paths and cycles 12 We write, more informally, W : u 1 u 2... u k u k+1 or W : u 1 k u k+1. Write u v to say that there is a walk of some length from u to v. Here we understand that W : u v is always a specific walk, W = e 1 e 2... e k, although we sometimes do not care to mention the edges e i on it. The length of a walk W is denoted by W. DEFINITION. Let W = e 1 e 2... e k (e i = u i u i+1 ) be a walk. W is closed, if u 1 = u k+1. W is a path, if u i = u j for all i = j. W is a cycle, if it is closed, and u i = u j for i = j except that u 1 = u k+1. W is a trivial path, if its length is 0. A trivial path has no edges. For a walk W : u = u 1... u k+1 = v, also W 1 : v = u k+1... u 1 = u is a walk in G, called the inverse walk of W. A vertex u is an end of a path P, if P starts or ends in u. The join of two walks W 1 : u v and W 2 : v w is the walk W 1 W 2 : u w. (Here the end v must be common to the walks.) Paths P and Q are disjoint, if they have no vertices in common, and they are independent, if they can share only their ends. Clearly, the inverse walk P 1 of a path P is a path (the inverse path of P). The join of two paths need not be a path. A (sub)graph, which is a path (cycle) of length k 1 (k, resp.) having k vertices is denoted by P k (C k, resp.). If k is even (odd), we say that the path or cycle is even (odd). Clearly, all paths of length k are isomorphic. The same holds for cycles of fixed length. P 5 C 6 Lemma 1.3. Each walk W : u v with u = v contains a path P : u v, that is, there is a path P : u v that is obtained from W by removing edges and vertices. Proof. Let W : u = u 1... u k+1 = v. Let i < j be indices such that u i = u j. If no such i and j exist, then W, itself, is a path. Otherwise, in W = W 1 W 2 W 3 : u u i u j v the portion U 1 = W 1 W 3 : u u i = u j v is a shorter walk. By repeating this argument, we obtain a sequence U 1, U 2,..., U m of walks u v with W > U 1 > > U m. When the procedure stops, we have a path as required. (Notice that in the above it may very well be that W 1 or W 3 is a trivial walk.)

14 1.3 Paths and cycles 13 DEFINITION. If there exists a walk (and hence a path) from u to v in G, let d G (u, v) = min{k u k v} be the distance between u and v. If there are no walks u v, let d G (u, v) = by convention. A graph G is connected, if d G (u, v) < for all u, v G; otherwise, it is disconnected. The maximal connected subgraphs of G are its connected components. Denote c(g) = the number of connected components of G. If c(g) = 1, then G is, of course, connected. The maximality condition means that a subgraph H G is a connected component if and only if H is connected and there are no edges leaving H, i.e., for every vertex v / H, the subgraph G[V H {v}] is disconnected. Apparently, every connected component is an induced subgraph, and N G (v) = {u d G(v, u) < } is the connected component of G that contains v G. In particular, the connected components form a partition of G. Shortest paths DEFINITION. Let G α be an edge weighted graph, that is, G α is a graph G together with a weight function α : E G R on its edges. For H G, let α(h) = α(e) e H be the (total) weight of H. In particular, if P = e 1 e 2... e k is a path, then its weight is α(p) = k i=1 α(e i). The minimum weighted distance between two vertices is d α G (u, v) = min{α(p) P : u v}. In extremal problems we seek for optimal subgraphs H G satisfying specific conditions. In practice we encounter situations where G might represent a distribution or transportation network (say, for mail), where the weights on edges are distances, travel expenses, or rates of flow in the network; a system of channels in (tele)communication or computer architecture, where the weights present the rate of unreliability or frequency of action of the connections; a model of chemical bonds, where the weights measure molecular attraction.

15 1.3 Paths and cycles 14 In these examples we look for a subgraph with the smallest weight, and which connects two given vertices, or all vertices (if we want to travel around). On the other hand, if the graph represents a network of pipelines, the weights are volumes or capacities, and then one wants to find a subgraph with the maximum weight. We consider the minimum problem. For this, let G be a graph with an integer weight function α : E G N. In this case, call α(uv) the length of uv. The shortest path problem: Given a connected graph G with a weight function α : E G N, find d α G (u, v) for given u, v G. Assume that G is a connected graph. Dijkstra s algorithm solves the problem for every pair u, v, where u is a fixed starting point and v G. Let us make the convention that α(uv) =, if uv / G. Dijkstra s algorithm: (i) Set u 0 = u, t(u 0 ) = 0 and t(v) = for all v = u 0. (ii) For i [0, ν G 1]: for each v / {u 1,..., u i }, replace t(v) by min{t(v), t(u i )+α(u i v)}. Let u i+1 / {u 1,..., u i } be any vertex with the least value t(u i+1 ). (iii) Conclusion: d α G (u, v) = t(v). Example 1.7. Consider the following weighted graph G. Apply Dijkstra s algorithm to the vertex v 0. u 0 = v 0, t(u 0 ) = 0, others are. t(v 1 ) = min{, 2} = 2, t(v 2 ) = min{, 3} = 3, others are. Thus u 1 = v 1. t(v 2 ) = min{3, t(u 1 )+α(u 1 v 2 )} = min{3, 4} = 3, t(v 3 ) = 2+1 = 3, t(v 4 ) = 2+3 = 5, t(v 5 ) = 2+2 = 4. Thus choose u 2 = v 3. t(v 2 ) = min{3, } = 3, t(v 4 ) = min{5, 3+2} = 5, t(v 5 ) = min{4, 3+1} = 4. Thus set u 3 = v 2. t(v 4 ) = min{5, 3+1} = 4, t(v 5 ) = min{4, } = 4. Thus choose u 4 = v 4. t(v 5 ) = min{4, 4+1} = 4. The algorithm stops. v v 1 v v 3 v v 5 We have obtained: t(v 1 ) = 2, t(v 2 ) = 3, t(v 3 ) = 3, t(v 4 ) = 4, t(v 5 ) = 4. These are the minimal weights from v 0 to each v i.

16 1.3 Paths and cycles 15 The steps of the algorithm can also be rewritten as a table: v v v v v The correctness of Dijkstra s algorithm can verified be as follows. Let v V be any vertex, and let P : u 0 u v be a shortest path from u 0 to v, where u is any vertex u = v on such a path, possibly u = u 0. Then, clearly, the first part of the path, u 0 u, is a shortest path from u 0 to u, and the latter part u v is a shortest path from u to v. Therefore, the length of the path P equals the sum of the weights of u 0 u and u v. Dijkstra s algorithm makes use of this observation iteratively.

17 2 Connectivity of Graphs 2.1 Bipartite graphs and trees In problems such as the shortest path problem we look for minimum solutions that satisfy the given requirements. The solutions in these cases are usually subgraphs without cycles. Such connected graphs will be called trees, and they are used, e.g., in search algorithms for databases. For concrete applications in this respect, see T.H. CORMEN, C.E. LEISERSON AND R.L. RIVEST, Introduction to Algorithms, MIT Press, Certain structures with operations are representable + as trees. These trees are sometimes called construction trees, decomposition trees, factorization trees or grammatical y trees. Grammatical trees occur especially in linguistics, where syntactic structures of sentences are analyzed. x + On the right there is a tree of operations for the arithmetic formula y z x (y+z)+y. Bipartite graphs DEFINITION. A graph G is called bipartite, if V G has a partition to two subsets X and Y such that each edge uv G connects a vertex of X and a vertex of Y. In this case, (X, Y) is a bipartition of G, and G is (X, Y)-bipartite. A bipartite graph G (as in the above) is complete (m, k)- bipartite, if X = m, Y = k, and uv G for all u X and v Y. All complete (m, k)-bipartite graphs are isomorphic. Let K m,k denote such a graph. A subset X V G is stable, if G[X] is a discrete graph. The following result is clear from the definitions. Theorem 2.1. A graph G is bipartite if and only if V G has a partition to two stable subsets. Example 2.1. The k-cube Q k of Example 1.5 is bipartite for all k. Indeed, consider A = {u u has an even number of 1 s} and B = {u u has an odd number of 1 s}. Clearly, these sets partition B k, and they are stable in Q k. K 2,3

18 2.1 Bipartite graphs and trees 17 Theorem 2.2. A graph G is bipartite if and only if G it has no odd cycles (as subgraph). Proof. ( ) Observe that if G is (X, Y)-bipartite, then so are all its subgraphs. However, an odd cycle C 2k+1 is not bipartite. ( ) Suppose that all cycles in G are even. First, we note that it suffices to show the claim for connected graphs. Indeed, if G is disconnected, then each cycle of G is contained in one of the connected components G 1,..., G p of G. If G i is (X i, Y i )- bipartite, then G has the bipartition (X 1 X 2 X p, Y 1 Y 2 Y p ). Assume thus that G is connected. Let v G be a chosen vertex, and define X = {x d G (v, x) is even} and Y = {y d G (v, y) is odd}. Since G is connected, V G = X Y. Also, by the definition of distance, X Y =. Let then u, w G be both in X or both in Y, and let P : v u and Q : v w be (among the) shortest paths from v to u and w. Assume that x is the last common vertex of P and Q: P = P 1 P 2, Q = Q 1 Q 2, where P 2 : x u and Q 2 : x w are independent. Since P and Q are shortest paths, P 1 and Q 1 are shortest paths v x. Consequently, P 1 = Q 1. Thus P 2 and Q 2 have the same parity and hence the sum P 2 + Q 2 is even, i.e., the path P 1 2 Q 2 is even, and so uw / E G by assumption. Therefore X and Y are stable subsets, and G is bipartite as claimed. Checking whether a graph is bipartite is easy. Indeed, this can be done by using two opposite colours, say 1 and 2. Start from any vertex v 1, and colour it by 1. Then colour the neighbours of v 1 by 2, and proceed by colouring all neighbours of an already coloured vertex by the opposite colour. If the whole graph can be coloured without contradiction, then G is (X, Y)-bipartite, where X consists of those vertices with colour 1, and Y of those vertices with colour 2; otherwise, at some point one of the vertices gets both colours, and in this case, G is not bipartite. Example 2.2 (ERDÖS (1965)). We show that each graph G has a bipartite subgraph H G such that ε H 1 2 ε G. Indeed, let V G = X Y be a partition such that the number of edges between X and Y is maximum. Denote F = E G {uv u X, v Y}, and let H = G[F]. Obviously H is a spanning subgraph, and it is bipartite. By the maximum condition, d H (v) d G (v)/2, since, otherwise, v is on the wrong side. (That is, if v X, then the pair X = X\{v}, Y = Y {v} does better that the pair X, Y.) Now ε H = 1 2 d H (v) 1 v H d G(v) = 1 2 ε G. v G v 2 1 P 1 Q x 2 P 2 Q u w uw

19 2.1 Bipartite graphs and trees 18 Bridges DEFINITION. An edge e G is a bridge of the graph G, if G e has more connected components than G, that is, if c(g e) > c(g). In particular, and most importantly, an edge e in a connected G is a bridge if and only if G e is disconnected. On the right (only) the two horizontal lines are bridges. We note that, for each edge e G, e = uv is a bridge u, v in different connected components of G e. Theorem 2.3. An edge e G is a bridge if and only if e is not in any cycle of G. Proof. ( ) If there is a cycle in G containing e, say C = PeQ, then QP : v u is a path in G e, and so e is not a bridge. ( ) If e = uv is not a bridge, then u and v are in the same connected component of G e, and there is a path P : v u in G e. Now, ep : u v u is a cycle in G containing e. Lemma 2.1. Let e be a bridge in a connected graph G. (i) Then c(g e) = 2. (ii) Let H be a connected component of G e. If f H is a bridge of H, then f is a bridge of G. Proof. For (i), let e = uv. Since e is a bridge, the ends u and v are not connected in G e. Let w G. Since G is connected, there exists a path P : w v in G. This is a path of G e, unless P : w u v contains e = uv, in which case the part w u is a path in G e. For (ii), if f H belongs to a cycle C of G, then C does not contain e (since e is in no cycle), and therefore C is inside H, and f is not a bridge of H. Trees DEFINITION. A graph is called acyclic, if it has no cycles. An acyclic graph is also called a forest. A tree is a connected acyclic graph. By Theorem 2.3 and the definition of a tree, we have Corollary 2.1. A connected graph is a tree if and only if all its edges are bridges. Example 2.3. The following enumeration result for trees has many different proofs, the first of which was given by CAYLEY in 1889: There are n n 2 trees on a vertex set V of n elements. We omit the proof.

20 2.1 Bipartite graphs and trees 19 On the other hand, there are only a few trees up to isomorphism: n trees n trees The nonisomorphic trees of order 6 are: We say that a path P : u v is maximal in a graph G, if there are no edges e G for which Pe or ep is a path. Such paths exist, because ν G is finite. Lemma 2.2. Let P : u v be a maximal path in a graph G. Then N G (v) P. Moreover, if G is acyclic, then d G (v) = 1. Proof. If e = vw E G with w / P, then also Pe is a path, which contradicts the maximality assumption for P. Hence N G (v) P. For acyclic graphs, if wv G, then w belongs to P, and wv is necessarily the last edge of P in order to avoid cycles. Corollary 2.2. Each tree T with ν T 2 has at least two leaves. Proof. Since T is acyclic, both ends of a maximal path have degree one. Theorem 2.4. The following are equivalent for a graph T. (i) T is a tree. (ii) Any two vertices are connected in T by a unique path. (iii) T is acyclic and ε T = ν T 1. Proof. Let ν T = n. If n = 1, then the claim is trivial. Suppose thus that n 2. (i) (ii) Let T be a tree. Assume the claim does not hold, and let P, Q : u v be two different paths between the same vertices u and v. Suppose that P Q. Since P = Q, there exists an edge e which belongs to P but not to Q. Each edge of T is a bridge, and therefore u and v belong to different connected components of T e. Hence e must also belong to Q; a contradiction. (ii) (iii) We prove the claim by induction on n. Clearly, the claim holds for n = 2, and suppose it holds for graphs of order less than n. Let T be any graph of order n satisfying (ii). In particular, T is connected, and it is clearly acyclic.

21 2.1 Bipartite graphs and trees 20 Let P : u v be a maximal path in T. By Lemma 2.2, we have d T (v) = 1. In this case, P : u w v, where vw is the unique edge having an end v. The subgraph T v is connected, and it satisfies the condition (ii). By induction hypothesis, ε T v = n 2, and so ε T = ε T v + 1 = n 1, and the claim follows. (iii) (i) Assume (iii) holds for T. We need to show that T is connected. Indeed, let the connected components of T be T i = (V i, E i ), for i [1, k]. Since T is acyclic, so are the connected graphs T i, and hence they are trees, for which we have proved that E i = V i 1. Now, ν T = k i=1 V i, and ε T = k i=1 E i. Therefore, n 1 = ε T = k i=1 ( V i 1) = k V i k = n k, i=1 which gives that k = 1, that is, T is connected. Example 2.4. Consider a cup tournament of n teams. If during a round there are k teams left in the tournament, then these are divided into k pairs, and from each pair only the winner continues. If k is odd, then one of the teams goes to the next round without having to play. How many plays are needed to determine the winner? So if there are 14 teams, after the first round 7 teams continue, and after the second round 4 teams continue, then 2. So 13 plays are needed in this example. The answer to our problem is n 1, since the cup tournament is a tree, where a play corresponds to an edge of the tree. Spanning trees Theorem 2.5. Each connected graph has a spanning tree, that is, a spanning graph that is a tree. Proof. Let T G be a maximum order subtree of G (i.e., subgraph that is a tree). If V T = V G, there exists an edge uv / E G such that u T and v / T. But then T is not maximal; a contradiction. Corollary 2.3. For each connected graph G, ε G ν G 1. Moreover, a connected graph G is a tree if and only if ε G = ν G 1. Proof. Let T be a spanning tree of G. Then ε G ε T = ν T 1 = ν G 1. The second claim is also clear. Example 2.5. In Shannon s switching game a positive player P and a negative player N play on a graph G with two special vertices: a source s and a sink r. P and N alternate turns so that P designates an edge by +, and N by. Each edge can be designated at most once. It is P s purpose to designate a path s r (that is, to designate all edges in one such path), and N tries to block all paths s r (that is, to designate at least one edge in each such path). We say that a game(g, s, r) is

22 2.1 Bipartite graphs and trees 21 positive, if P has a winning strategy no matter who begins the game, negative, if N has a winning strategy no matter who begins the game, neutral, if the winner depends on who begins the game. The game on the right is neutral. LEHMAN proved in 1964 that Shannon s switching game(g, s, r) is positive if and only if there exists H G such that H contains s and r and H has two spanning trees with no edges in common. In the other direction the claim can be proved along the following lines. Assume that there exists a subgraph H containing s and r and that has two spanning trees with no edges in common. Then P plays as follows. If N marks by an edge from one of the two trees, then P marks by + an edge in the other tree such that this edge reconnects the broken tree. In this way, P always has two spanning trees for the subgraph H with only edges marked by + in common. In converse the claim is considerably more difficult to prove. There remains the problem to characterize those Shannon s switching games (G, s, r) that are neutral (negative, respectively). r s The connector problem To build a network connecting n nodes (towns, computers, chips in a computer) it is desirable to decrease the cost of construction of the links to the minimum. This is the connector problem. In graph theoretical terms we wish to find an optimal spanning subgraph of a weighted graph. Such an optimal subgraph is clearly a spanning tree, for, otherwise a deletion of any nonbridge will reduce the total weight of the subgraph. Let then G α be a graph G together with a weight function α : E G R + (positive reals) on the edges. Kruskal s algorithm (also known as the greedy algorithm) provides a solution to the connector problem. Kruskal s algorithm: For a connected and weighted graph G α of order n: (i) Let e 1 be an edge of smallest weight, and set E 1 = {e 1 }. (ii) For each i = 2, 3,..., n 1 in this order, choose an edge e i / E i 1 of smallest possible weight such that e i does not produce a cycle when added to G[E i 1 ], and let E i = E i 1 {e i }. The final outcome is T = (V G, E n 1 ).

23 2.1 Bipartite graphs and trees 22 By the construction, T = (V G, E n 1 ) is a spanning tree of G, because it contains no cycles, it is connected and has n 1 edges. We now show that T has the minimum total weight among the spanning trees of G. Suppose T 1 is any spanning tree of G. Let e k be the first edge produced by the algorithm that is not in T 1. If we add e k to T 1, then a cycle C containing e k is created. Also, C must contain an edge e that is not in T. When we replace e by e k in T 1, we still have a spanning tree, say T 2. However, by the construction, α(e k ) α(e), and therefore α(t 2 ) α(t 1 ). Note that T 2 has more edges in common with T than T 1. Repeating the above procedure, we can transform T 1 to T by replacing edges, one by one, such that the total weight does not increase. We deduce that α(t) α(t 1 ). The outcome of Kruskal s algorithm need not be unique. Indeed, there may exist several optimal spanning trees (with the same weight, of course) for a graph. Example 2.6. When applied to the weighted graph on the right, the algorithm produces the sequence: e 1 = v 2 v 4, e 2 = v 4 v 5, e 3 = v 3 v 6, e 4 = v 2 v 3 and e 5 = v 1 v 2. The total weight of the spanning tree is thus 9. Also, the selection e 1 = v 2 v 5, e 2 = v 4 v 5, e 3 = v 5 v 6, e 4 = v 3 v 6, e 5 = v 1 v 2 gives another optimal solution (of weight 9). v 3 1 v 2 2 v v 1 4 v 2 5 v Problem. Consider trees T with weight functions α : E T N. Each tree T of order n has exactly( n 2 ) paths. (Why is this so?) Does there exist a weighted tree Tα of order n such that the (total) weights of its paths are 1, 2,...,( n 2 )? In such a weighted tree T α different paths have different weights, and each i [1,( n 2 )] is a weight of one path. Also, α must be injective. No solutions are known for any n TAYLOR (1977) proved: if T of order n exists, then necessarily n = k 2 or n = k for some k 1. Example 2.7. A computer network can be presented as a graph G, where the vertices are the node computers, and the edges indicate the direct links. Each computer v has an address a(v), a bit string (of zeros and ones). The length of an address is the number of its bits. A message that is sent to v is preceded by the address a(v). The Hamming distance h(a(v), a(u)) of two addresses of the same length is the number of places, where a(v) and a(u) differ; e.g., h(00010, 01100) = 3 and h(10000, 00000) = 1. It would be a good way to address the vertices so that the Hamming distance of two vertices is the same as their distance in G. In particular, if two vertices were adjacent, their addresses should differ by one symbol. This would make it easier for a node computer to forward a message.

25 2.2 Connectivity 24 Separating sets DEFINITION. A vertex v G is a cut vertex, if c(g v) > c(g). A subset S V G is a separating set, if G S is disconnected. We also say that S separates the vertices u and v and it is a (u, v)- separating set, if u and v belong to different connected components of G S. If G is connected, then v is a cut vertex if and only if G v is disconnected, that is, {v} is a separating set. The following lemma is immediate. Lemma 2.3. If S V G separates u and v, then every path P : u v visits a vertex of S. Lemma 2.4. If a connected graph G has no separating sets, then it is a complete graph. Proof. If ν G 2, then the claim is clear. For ν G 3, assume that G is not complete, and let uv / G. Now V G \{u, v} is a separating set. The claim follows from this. DEFINITION. The (vertex) connectivity number κ(g) of G is defined as κ(g) = min{k k = S, G S disconnected or trivial, S V G }. A graph G is k-connected, if κ(g) k. In other words, κ(g) = 0, if G is disconnected, κ(g) = ν G 1, if G is a complete graph, and otherwise κ(g) equals the minimum size of a separating set of G. Clearly, if G is connected, then it is 1-connected. DEFINITION. An edge cut F of G consists of edges so that G F is disconnected. Let κ (G) = min{k k = F, G F disconnected, F E G }. For trivial graphs, let κ (G) = 0. A graph G is k-edge connected, if κ (G) k. A minimal edge cut F E G is a bond (F\{e} is not an edge cut for any e F). Example 2.8. Again, if G is disconnected, then κ (G) = 0. On the right, κ(g) = 2 and κ (G) = 2. Notice that the minimum degree is δ(g) = 3. Lemma 2.5. Let G be connected. If e = uv is a bridge, then either G = K 2 or one of u or v is a cut vertex.

26 2.2 Connectivity 25 Proof. Assume that G = K 2 and thus that ν G 3, since G is connected. Let G u = NG e (u) and G v = NG e (v) be the connected components of G e containing u and v. Now, either ν Gu 2 (and u is a cut vertex) or ν Gv 2 (and v is a cut vertex). Lemma 2.6. If F be a bond of a connected graph G, then c(g F) = 2. Proof. Since G F is disconnected, and F is minimal, the subgraph H = G (F\{e}) is connected for given e F. Hence e is a bridge in H. By Lemma 2.1, c(h e) = 2, and thus c(g F) = 2, since H e = G F. Theorem 2.6 (WHITNEY (1932)). For any graph G, κ(g) κ (G) δ(g). Proof. Assume G is nontrivial. Clearly, κ (G) δ(g), since if we remove all edges with an end v, we disconnect G. If κ (G) = 0, then G is disconnected, and in this case also κ(g) = 0. If κ (G) = 1, then G is connected and contains a bridge. By Lemma 2.5, either G = K 2 or G has a cut vertex. In both of these cases, also κ(g) = 1. Assume then that κ (G) 2. Let F be an edge cut of G with F = κ (G), and let e = uv F. Then F is a bond, and G F has two connected components. Consider the connected subgraph e G H H = G (F\{e}) = (G F)+e,.... where e is a bridge. F Now for each f F\{e} choose an end different from u and v. (The choices for different edges need not be different.) Note that since f = e, either end of f is different from u or v. Let S be the collection of these choices. Thus S F 1 = κ (G) 1, and G S does not contain edges from F\{e}. If G S is disconnected, then S is a separating set and so κ(g) S κ (G) 1 and we are done. On the other hand, if G S is connected, then either G S = K 2 (= e), or either u or v (or both) is a cut vertex of G S (since H S = G S, and therefore G S H is an induced subgraph of H). In both of these cases, there is a vertex of G S, whose removal results in a trivial or a disconnected graph. In conclusion, κ(g) S + 1 κ (G), and the claim follows. Menger s theorem Theorem 2.7 (MENGER (1927)). Let u, v G be nonadjacent vertices of a connected graph G. Then the minimum number of vertices separating u and v is equal to the maximum number of independent paths from u to v. Proof. If a subset S V G is (u, v)-separating, then every path u v of G visits S. Hence S is at least the number of independent paths from u to v.

27 2.2 Connectivity 26 Conversely, we use induction on m = ν G + ε G to show that if S = {w 1, w 2,..., w k } is a (u, v)-separating set of the smallest size, then G has at least (and thus exactly) k independent paths u v. The case for k = 1 is clear, and this takes care of the small values of m, required for the induction. (1) Assume first that u and v have a common neighbour w N G (u) N G (v). Then necessarily w S. In the smaller graph G w the set S\{w} is a minimum (u, v)- separating set, and the induction hypothesis yields that there are k 1 independent paths u v in G w. Together with the path u w v, there are k independent paths u v in G as required. (2) Assume then that N G (u) N G (v) =, and denote by H u = NG S (u) and H v = NG S (v) the connected components of G S for u and v. (2.1) Suppose next that S N G (u) and S N G (v). Let v be a new vertex, and define G u to be the graph on H u S { v} having the edges of G[H u S] together with vw i for all i [1, k]. The graph G u is connected and it is smaller than G. Indeed, in order for S to be a minimum separating set, all w i S have to be adjacent to some vertex in H v. This shows that ε Gu ε G, and, moreover, the assumption (2.1) rules out the case H v = {v}. So H v 2 and ν Gu < ν G. If S is any(u, v)-separating set of G u, then S will separate u from all w i S\S in G. This means that S separates u and v in G. Since k is the size of a minimum (u, v)- separating set, we have S k. We noted that G u is smaller than G, and thus by the induction hypothesis, there are k independent paths u v in G u. This is possible only if there exist k paths u w i, one for each i [1, k], that have only the end u in common. By the present assumption, also u is nonadjacent to some vertex of S. A symmetric argument applies to the graph G v (with a new vertex û), which is defined similarly to G u. This yields that there are k paths w i v that have only the end v in common. When we combine these with the above paths u w i, we obtain k independent paths u w i v in G. (2.2) There remains the case, where for all (u, v)-separating sets S of k elements, either S N G (u) or S N G (v). (Note that then, by (2), S N G (v) = or S N G (u) =.) Let P = e f Q be a shortest path u v in G, where e = ux, f = xy, and Q : y v. Notice that, by the assumption (2), P 3, and so y = v. In the smaller graph G f, let S be a minimum set that separates u and v. If S k, then, by the induction hypothesis, there are k independent paths u v in G f. But these are paths of G, and the claim is clear in this case. u w k... w 2 w 1 v

### 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

### Graph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick

Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements

### 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.

### (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

### 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

### 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

### Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest.

2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### 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

### 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

### 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

### 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.

### 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...............................

### 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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### 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

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### 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

### 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.

### 4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests

4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in

### 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

### 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

### 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

### 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?

### 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

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### 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

### Coloring Eulerian triangulations of the projective plane

Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A simple characterization

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### 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

### 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

### 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

### 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:

### 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

### 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.

### Math 4707: Introduction to Combinatorics and Graph Theory

Math 4707: Introduction to Combinatorics and Graph Theory Lecture Addendum, November 3rd and 8th, 200 Counting Closed Walks and Spanning Trees in Graphs via Linear Algebra and Matrices Adjacency Matrices

### Chapter 2. Basic Terminology and Preliminaries

Chapter 2 Basic Terminology and Preliminaries 6 Chapter 2. Basic Terminology and Preliminaries 7 2.1 Introduction This chapter is intended to provide all the fundamental terminology and notations which

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### 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

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### A simple existence criterion for normal spanning trees in infinite graphs

1 A simple existence criterion for normal spanning trees in infinite graphs Reinhard Diestel Halin proved in 1978 that there exists a normal spanning tree in every connected graph G that satisfies the

### Relations Graphical View

Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### 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

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### 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

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### D I P L O M A R B E I T. Tree-Decomposition. Graph Minor Theory and Algorithmic Implications. Ausgeführt am Institut für

D I P L O M A R B E I T Tree-Decomposition Graph Minor Theory and Algorithmic Implications Ausgeführt am Institut für Diskrete Mathematik und Geometrie der Technischen Universität Wien unter Anleitung

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### 1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if

Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these

### Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### 6. Planarity. Fig Fig. 6.2

6. Planarity Let G(V, E) be a graph with V = {v 1, v 2,..., v n } and E = {e 1, e 2,..., e m }. Let S be any surface (like the plane, sphere) and P = {p 1, p 2,..., p n } be a set of n distinct points

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### A CHARACTERIZATION OF TREE TYPE

A CHARACTERIZATION OF TREE TYPE LON H MITCHELL Abstract Let L(G) be the Laplacian matrix of a simple graph G The characteristic valuation associated with the algebraic connectivity a(g) is used in classifying

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### 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.

### A Study of Sufficient Conditions for Hamiltonian Cycles

DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### 7. Colourings. 7.1 Vertex colouring

7. Colourings Colouring is one of the important branches of graph theory and has attracted the attention of almost all graph theorists, mainly because of the four colour theorem, the details of which can

### Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

### 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

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,

### Chapter 8 Independence

Chapter 8 Independence Section 8.1 Vertex Independence and Coverings Next, we consider a problem that strikes close to home for us all, final exams. At the end of each term, students are required to take

### 9.1. Vertex colouring. 9. Graph colouring. Vertex colouring.

Vertex colouring. 9. Graph colouring k-vertex-critical graphs Approximation algorithms Upper bounds for the vertex chromatic number Brooks Theorem and Hajós Conjecture Chromatic Polynomials Colouring of

### 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

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### 1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### 6.042/18.062J Mathematics for Computer Science October 3, 2006 Tom Leighton and Ronitt Rubinfeld. Graph Theory III

6.04/8.06J Mathematics for Computer Science October 3, 006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Graph Theory III Draft: please check back in a couple of days for a modified version of these

### . 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

### Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

### Just the Factors, Ma am

1 Introduction Just the Factors, Ma am 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

### Lecture 1: Course overview, circuits, and formulas

Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### Factors and Factorizations of Graphs

Factors and Factorizations of Graphs Jin Akiyama and Mikio Kano June 2007 Version 1.0 A list of some notation G denotes a graph. X Y X is a subset of Y. X Y X is a proper subset of Y. X Y X \ Y, where

### 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

### Principle of (Weak) Mathematical Induction. P(1) ( n 1)(P(n) P(n + 1)) ( n 1)(P(n))

Outline We will cover (over the next few weeks) Mathematical Induction (or Weak Induction) Strong (Mathematical) Induction Constructive Induction Structural Induction Principle of (Weak) Mathematical Induction

### Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

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

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### On Total Domination in Graphs

University of Houston - Downtown Senior Project - Fall 2012 On Total Domination in Graphs Author: David Amos Advisor: Dr. Ermelinda DeLaViña Senior Project Committee: Dr. Sergiy Koshkin Dr. Ryan Pepper

### / 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

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### The Pigeonhole Principle

The Pigeonhole Principle 1 Pigeonhole Principle: Simple form Theorem 1.1. If n + 1 objects are put into n boxes, then at least one box contains two or more objects. Proof. Trivial. Example 1.1. Among 13

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### TREES IN SET THEORY SPENCER UNGER

TREES IN SET THEORY SPENCER UNGER 1. Introduction Although I was unaware of it while writing the first two talks, my talks in the graduate student seminar have formed a coherent series. This talk can be

### Chapter 2 Paths and Searching

Chapter 2 Paths and Searching Section 2.1 Distance Almost every day you face a problem: You must leave your home and go to school. If you are like me, you are usually a little late, so you want to take