Honours Graph Theory


 Merilyn Jackson
 11 months ago
 Views:
Transcription
1 University of Zimbabwe HMTH215 Graph Theory Honours Graph Theory Author: P. Mafuta Department: Mathematics April 6, 2016
2 Chapter 1 Introduction: Basic Graph Theory This course serves to answer many questions arise in ordinary life and science in general. Just to mention but a few, it is used to select the best chemical in chemistry, designing networks, minimize cost, manage corruption and solve data communication problems. Definition A graph G = (V, E) consists of a finite nonempty set V (G) of elements called vertices and a (possibly empty) set E(G) of elements called edges. V (G) is called the vertex set of G and E(G) is called an edge set of G. NB A graph is not drawn uniquely, what matters is that the same vertices are joined together by the same edges. Definition If two vertices of a graph are joined by two or more edges, then this graph has multiple edges. An edge joining a vertex to itself is called a loop. Definition A graph with one vertex is called a trivial graph, otherwise the graph is nontrivial. Definition A simple graph is a graph that has no loops or multiple edges. Definition Two vertices of the same edge are said to be incident with the edge and two edges sharing a common vertex are said to be incident with the vertex. Two vertices incident with an edge are said to be adjacent Adjacent and Incident matrices of a graph Definition Let G = (V, E) be a graph such that V (G) = {v 1, v 2, v 3,..., v n } and E(G) = {e 1, e 2, e 3,..., e m }. We define the adjacent matrix, say A, of G to be the n n matrix where the ij th entry is the number of edges joining v i to v j. We define the incident matrix, say M, of G to be the n m matrix where the ij th entry is 1 if vertex v i is incident to the edge e j and 0 otherwise. 1
3 Definition Let G be a graph. Then a graph H = (V (H), E(H)) is a subgraph of G if V (H) V (G) and E(H) E(G). Thus a graph is a subgraph of itself. Definition Let G = (V, E) be a graph. The degree or valency of a vertex v V (G) is the number of edges incident with v, where a loop contributes two units to the degree. We denote the degree of a vertex v by deg G (v). A vertex of degree zero is called an isolated vertex. Definition Let G be a graph. The number of vertices in V (G) is called the order of graph G and we denote it by n. The number of edges in E(G) is called the size of G and we denote it by m. Lemma Handshaking lemma: In any graph, the sum of all vertex degree is equal to twice the number of edges, i.e., deg G (v) = 2m v V Proof. We ignore vertices of degree zero since they contribute nothing to the sum. We notice that each edge has exactly two vertices, i.e., a vertex at each end. So each edge contributes 2 units to the sum of the degrees. Hence the result follows. Corollary In any graph G (i) The sum of all vertex degrees is an even number. (ii) The number of vertices of odd degree is even Proof. Item (i) follows directly from the lemma above. To prove item (ii), suppose contrary to the claim that the number of vertices of odd degree is odd. Then the sum of all vertex degrees of vertices of odd degree is odd. Further, we note that the sum of all vertex degrees of all vertices of even degree is even. This implies that the sum of all vertex degree is odd, a contradiction to the handshaking lemma. Hence our supposition is false and the result follows. Definition A sequence of degrees of vertices in a graph given in descending order is called the degree sequence. A sequence of nonnegative integers is called graphic if the exists a graph whose degree sequence is precisely that sequence. NB From the lemma above it is clear that if the sum of the terms of a sequence is odd then the sequence is not graphic. However, its not always true to say that if the sum of the terms of a sequence is even then the sequence is graphic. This calls for the follow algorithm to determine whether or not a given sequence is graphic. Theorem Havel Hakimi: Consider the following two sequences and assume (i) is in descending order. (i) s, t 1, t 2,..., t s, d 1, d 2,..., d n 2
4 (ii) t 1 1, t 2 1,..., t s 1, d 1,..., d n. Then (i) is graphic iff (ii) is graphic. Proof. Ex For instance, the sequence 6, 6, 6, 6, 4, 3, 3, 0 can be reduced using the above theorem to 3, 1, 0, 0, 0 which is not graphic, since there is no graph with one vertex of degree 3, one vertex of degree 1 and three vertices of degree 0. Hence the original sequence also is not graphic. 1.1 Types of Graphs Definition Let G = (V (G), E(G)) and H = (V (H), E(H)) be graphs. Then (a) G and H are identical iff V (G) = V (H) and E(G) = E(H). (b) G and H of order n are said to be isomorphic if the vertices of G and H can be labelled with numbers 1 to n such that whenever vertex i is adjacent to vertex j in G, then i is adjacent to vertex j in H and conversely. Such a labeling is the same as one to one correspondence between V (G) and V (H) that preserves adjacency. Thus G and H are isomorphic if there is a bijection θ : V (G) V (H) such that uv E(G) iff θ(u)θ(v) E(H). Remark: Saying G and H are isomorphic amounts to saying that G can be relabelled to get another graph, say G, identical to H. In general, for large graphs it is difficult to tell whether or not two graphs are isomorphic. However, if two graphs are isomorphic, then their degree sequence must be the same. Thus if we are asked to tell whether given graphs are isomorphic, the first thing we have to do is to check whether they have the same degree sequence. Then if the degree sequence is the same, we have to do some more checking, since other graphs have the same degree sequence but are not isomorphic. Definition A graph G is called a regular graph if all the vertices are of the same degree, i.e., deg G (v) = k, v V (G) for some k. We then call G a k regular graph. A 3 regular graph is called a cubic graph, for instance the famous Petersen graph on the cover page, which we shall discuss later. Definition A complete graph, which we denote by K n, is a simple graph of order n such every vertex is adjacent to every other vertex, i.e., u, v V (K n ), u and v are adjacent. For n(n 1) instance, a trivial graph is a complete K 1 graph. In general, K n has edges. In addition, 2 K n has n subgraphs isomorphic to K n 1. Definition A graph G such that E(G) = is called a null graph. Thus in a null graph, every vertex is an isolated vertex. 3
5 Definition A graph G such that V (G) can be split into two disjoint sets V 1 and V 2 in such that every edge of G vertex of V 1 to a vertex of V 2 is called a bipartite graph. If G is a simple graph then G is called a complete bipartite graph. We denote a complete bipartite graph by K m,n where in this case V 1 = m and V 2 = n. A K 1,n is called a star graph. A star K 1,3 is called a claw. Definition Let G = (V, E) be any graph, and let S V be any subset of vertices of G. Then the induced subgraph, say G[S] is the graph whose vertex set is S and whose edge set consists of all of the edges in E that have both endpoints in S. A clawfree graph is a graph that does not have a claw as an induced subgraph. 4
6 Chapter 2 Connectedness in graphs Definition A walk, W say, in a graph G is an alternating sequence: v 0, e 1, v 1, e 2, v 2, e 3,..., v r 1, e r, v r of vertices and edges such that e i = v i 1 v i for i = 1, 2, 3,..., r and r is called the length of the walk. That is, the number of edges involved is its length. Remark. (a) In any walk, the last vertex on an edge is the first vertex of the next edge. (b) A vertex maybe repeating in a walk, i.e., one can have a walk of the form u, uv.v, vw, w, wx, x, xv, v, vz, z etc. (c) An edge may be repeated in a walk. Definition If all the edges of a walk are different, then the walk is called a trail. If all the vertices of a walk are different, then it is called a path. We denote by P uv a path from a vertex u to v, also known as a u v path. Definition Definition In a walk W, if the initial vertex v 0 and the final vertex v r are the same, i.e., v 0 = v r, then the walk is called a closed walk. Further, if W is a closed walk with all vertices different except v 0 and r 3, then W is called a cycle of length r or simply an r cycle. We denote by C n a cycle with n vertices. Definition Let G 1 = (V (G 1 ), E(G 1 )) and G 2 = (V (G 2 ), E(G 2 )) be any two graphs. Then the union G 1 G 2 of G 1 and G 2 is the graph with vertex set V (G 1 ) V (G 2 ) and edge set E(G 1 ) E(G 2 ). NB We can remove an edge in a graph and/or any vertex (and the edge incident to it) to obtain another graph. If we remove the vertex v from G, we denote the resulting graph by G v. If we 5
7 delete a set of vertices V, we denote the resulting graph by G V (G e or G E for edges). We call G V and G E vertex deleted subgraph and edge deleted subgraph, respectively. Also, we can remove the edge e = vw and identify v and w so that the resulting vertex v = w is incident to all edges that were originally incident with v or w. We denote the resulting graph by G \ {e} and call the deletion of e from G to obtain G \ {e} an edge contraction. A contraction of G is the graph obtained from G after a succession of edge contractions. Definition A graph G is connected if the exists a u v path for all u, v V (G), otherwise it is disconnected. The maximal connected subgraphs that make up a disconnected graph are called components of G. A connected regular graph where each vertex is of degree two is called a circuit or cycle C n graph denoted C n. Theorem Let G be a connected graph of order n and size m. Then n m + 1. Proof. We prove by induction on the number of edges m. If m = 1 or m = 2 then the theorem holds. So assume that the theorem holds for each graph with fewer than k edges, i.e., for m < k. Let G be a graph with k edges and n vertices. We consider two cases. Case Assume first that G contains a cycle. Then by removing one edge from the cycle, we obtain the graph H say, still connected and has k 1 edges. The number of vertices of H is still n and by inductive hypothesis n (k 1) + 1. So n k and certainly n k + 1. Hence we are done by principle of mathematical induction. Case Now assume that G has no cycle. Let P ab be a longest path in G. Then deg G (a) = deg G (b) = 1, since a and b are end vertices of the path. Remove the vertex a and the edge incident to it. This yeilds a graph, say H, which is connected and has n 1 vertices and k 1 edges. So by inductive hypothesis n 1 (k 1) + 1, i.e., n k + 1. Thus we are done by principle of mathematical induction. Definition Two path in a graph are called edge disjoint if they have no edge in common. Similarly, they are called vertex disjoint if they have no vertex in common. Hence vertex disjoint path are edge disjoint but the converse is not necessarily true. Some important definitions Definition A cycle of length 3 is called a triangle. The graph that has no subgraph isomorphic to a triangle is called a triangle free graph. A cycle of length 4 is denoted by C 4. A graph is called C 4 free if does not contain a cycle of length 4. The length of a shortest cycle in a graph is called girth and is denoted by g(g). In contrast, the length a longest cycle in G is called the circumference, denoted c(g). 6
8 Definition The distance, d(u, v), between any two vertices u and v in G is the length of a shortest path joining u and v. The eccentricity, ecc(v) of a vertex v V (G) is the distance from v to a vertex furthest from it in G. The maximum eccentricity is called the diameter and the minimum eccentricity is called the radius. We denote the diameter and the radius respectively by diam(g) and rad(g). Definition A leaf or end vertex is a vertex v of graph G such that deg G (v) = 1. A vertex of degree at least two is called an internal or interior vertex. Definition A subgraph H of G is called a spanning subgraph if V (H) = V (G). Thus a spanning cycle of G is a cycle that contains all vertices of G. Similarly, a spanning path is a path that contains all vertices of G. Definition The smallest of all the degrees of vertices in a graph G is called the minimum degree and the largest of all the degrees is called the maximum degree. We denote by δ(g) and bigtriangleup(g) the minimum degree and maximum degree, respectively. Definition The length of a walk, W, is called even(odd) if there are even(odd) number of edges in the walk. Lemma Let G be a bipartite graph. Then every cycle in G is of even length. Let V 1 (G) and V 2 (G) be two disjoint sets that forms V (G). Let v 1, v 2, v 3,..., v k, v 1 be a cycle in G. Then it suffices to show that k is even. Assume without loss of generality that v 1 V 1. Since G is a bipartite graph, v 2 V 2, v 3 V 1, v 4 V 2, v 5 V 1 and so on. Thus v k must lie in V 2, since v 1 V 1 and v k is adjacent to v 1. Hence k must be even and the result follows. Theorem Let G be a simple graph of order n. If G has k components, then its size m satisfies n k m 1 (n k)(n k + 1). 2 Proof. Ex. Connected and disconnected graphs Definition A disconnecting set of a connected graph is a set of edges of G whose removal disconnects G. A cutset is any disconnecting set of G no proper subset of which is a disconnecting set. A bridge is any cutset that contains one edge, i.e., it is an edge whose removal disconnects G. Definition Let G be a graph. The edgeconnectivity, λ(g), of G is the size of the smallest cutset in G, i.e., the minimum number of edges whose removal disconnects G. If λ(g) k, then we say G is k edge connected. A separating set of a connected graph G, is a set of vertices of G which when deleted disconnects G. A separating set with only one vertex is called a cutvertex or an articulationvertex, i.e., a cutvertex is a vertex whose removal disconnects G. The minimum number of vertices whose deletion disconnects G is called the vertexconnectivity, denoted by κ(g). That is, κ(g) is the size of the smallest separating set. G is k connected if κ(g) k. A vertexcutset of a graph G is a separating set, S say, such that no proper subset of it disconnects G. 7
9 Theorem Let G be a connected graph. Then κ(g) λ(g) δ(g). Proof. Since δ(g) is the minimum degree, there exist at least one vertex of degree δ. Let v V (G) be a vertex of degree δ and u 1, u 2, u 3,..., u δ N(v). Then by deleting the edges vu i, i = 1, 2, 3,..., δ, we disconnect the graph. Thus the minimum number of edges required to disconnect the graph can not exceed δ. That is λ(g) δ(g). Further, since λ(g) is the minimum number of edges whose removal disconnects G, there is a set of λ(g) edges whose removal disconnects the graph into at least two components. It follows that, we can also disconnect G by removing one suitably chosen vertex from each of these λ(g) edges. Hence the minimum number of vertices whose deletion disconnects G cannot exceeds the edge connectivity λ(g). So κ(g) λ(g) and the result follows. Definition A connected graph with no cut vertices is called a block. NB Every graph is a union of blocks. Futher a block with at least 3 vertices is 2 connected. Definition A family of paths in a graph G is said to be internally disjoint if no vertex of G is an internal vertex of more than one path of the family. Theorem Let G be a graph of order n 3. Then G is 2 connected iff any two vertices of G are connected by at least two internally disjoint paths. Proof. Ex. Corollary If G is 2 connected, then any two vertices of G lie on a common cycle. Definition An edge of a graph G is said to be subdivided when it is deleted and replaced by a path of length two connecting its ends. The internal vertex of this path is thus a new vertex. Corollary Let G be a block with order n 3. Then any two vertices lie on a common cycle. Theorem Menger s Theorem: Edge form. Let G be a connected graph, and u, v V (G) be any two vertices in G. Then the maximum number of edge disjoint paths from u to v is equal to the minimum number of edges separating u from v. Proof. Ex. Corollary A connected graph is k connected if and only if any two vertices of G are connected by at least k edge disjoint paths. Theorem Menger s Theorem: Vertex form. Let G be a connected graph, and u, v V (G) be any two nonadjacent vertices in G. Then the maximum number of vertexdisjoint paths from u to v is equal to the minimum number of vertices separating u from v. 8
10 2.1 Trees and forest Definition A tree is a connected graph without cycles. A collection of trees is called a forest. A tree T is called a spanning tree of a graph G if it is a spanning subgraph of G. A graph with no cycles is called an acyclic graph. Definition The leaf number, denoted by L(G), of a graph G is the maximum number of leaf vertices contained in a spanning tree of G. Its applications are legion in network designs and in solving data communication problems. Theorem Every tree has at least two end vertices. Proof. Ex. Theorem Every connected graph G contains a spanning tree. Theorem Let T be a graph with order n and size m. Then the following statements are equivalent: 1. T is a tree. 2. T is acyclic and n = m T is connected and n = m T is connected and T e is disconnected e E(T ). That is, every edge is a bridge. 5. x, y V (T ),! P (x, y), an x y path in T. 6. T has no cycles but the addition of one new edge creates exactly one cycle. Proof. (a) = (b). Assume that (a) holds. Then T is a tree and by definition it is a connected graph without cycles. Hence T is acyclic. So it is enough to show that n = m + 1. We prove this by induction on the number of edges m. If T = K 1 then n = 1 and m = 0 and the result holds. So we assume that E(T ) and that the result is true for every graph with m 1 edges. Since T is a tree, it has at least two end vertices. Let x be a leaf vertex of T. Then deg T (x) = 1. Let T x = T x be a graph obtained from T by deleting the vertex x. Then T x has order n 1 and size m 1. So by inductive assumption, V (T x ) = E(T x ) +1. Thus n 1 = (m 1)+1 and so n = m+1 as desired. (b) = (c). Assume that (b) is true. Then T is acyclic and n = m + 1. It suffices to show that T is connected. Assume contrary to the claim that T is disconnected into k components. Then k 2, otherwise T is connected. Let T 1, T 2, T 3,..., T k be the components of T where each T i has order n i. Now for each i, T i has no cycles and has n i 1 edges. This implies that T (n 1 1) + (n 2 1) n k 1 edges, i.e., T has n k edges, where k 2. This contradicts the fact that T has n 1 edges. Therefore T must be connected. (c) = (d). Assume that (c) holds. Then T is connected and n = m + 1. It is adequate to 9
11 show that every edge of T is a bridge. Assume that T has an edge which is not a bridge. Then the removal of that edge yields a connected graph with n 2 edges and n vertices, a contradiction. Hence T e is disconnected e E(T ). (d) = (e). Assume that (d) is true and suppose contrary to the claim that for some x, y V (T ) that there exists at least two paths from x to y. Then T has at least one cycle and the deletion of one edge on such a cycle does not disconnect the graph. This is a contradiction to the fact that every edge of T is a bridge. Hence (e) holds also. (e) = (f). If (e) holds then clearly, T has no cycles otherwise there exists at least two paths from x to y for some x, y V (T ), which is not allowed. Further, from (e), we conclude that T is connected, hence the addition of a new edge creates a cycle in T. To show uniqueness, we suppose on contrary that the addition of one creates at least two cycles. Then it implies that some vertices of T are connected by more than one path, contradicting (e). Hence (e) implies (f). (f) = (a). Following (f), we notice that T has no cycles. So it is enough to show that T is connected for it to be a tree. Suppose on contrary that T is disconnected. Then by adding an edge from one component of T to the other, we see that no cycle is created. This contradicts (f). Hence T must be connected. This completes the proof. 2.2 Eulerian and Hamiltonian graphs Definition A graph G is Eulerian if contains a closed trail that includes every edge of edge. G is called semieulerian if it contains a trail that includes edge. Thus every Eulerian graph is semieulerian. Definition A graph G is said to be Hamiltonian if it contains a spanning cycle. G is said to be traceable if it contains a spanning path. Definition Definition Everybody is a genius. But if you judge a fish by its ability to climb a tree, it will live its whole life believing that it is stupid. Albert Einstein 10
Graph Theory. Clemens Heuberger and Stephan Wagner. AIMS, January/February 2009
Graph Theory Clemens Heuberger and Stephan Wagner AIMS, January/February 2009 1 Basic Definitions Definition 1.1 A graph is a pair G = (V (G),E(G)) of a set of vertices V (G) and a set of edges E(G), where
More informationGraph Theory. 1 Defining and representing graphs
Graph Theory 1 Defining and representing graphs A graph is an ordered pair G = (V, E), where V is a finite, nonempty set of objects called vertices, and E is a (possibly empty) set of unordered pairs
More informationBasic Combinatorics. Math 40210, Section 01 Fall Basic graph definitions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Basic graph definitions It may seem as though the beginning of graph theory comes with a lot of definitions. This may be so, but hopefully by repeatedly
More information2. Determine each of the 11 nonisomorphic graphs of order 4, and give a planar representation of each.
Chapter 11 Homework. Determine each of the 11 nonisomorphic graphs of order 4, and give a planar representation of each. 3. Does there exist a graph of order 5 whose degree sequence equals (4, 4, 3,, )?
More informationGRAPH THEORY STUDY GUIDE
GRAPH THEORY STUDY GUIDE 1. Definitions Definition 1 (Partition of A). A set A = A 1,..., A k of disjoint subsets of a set A is a partition of A if A of all the sets A i A and A i for every i. Definition
More information1 Connected simple graphs on four vertices
1 Connected simple graphs on four vertices Here we briefly answer Exercise 3.3 of the previous notes. Please come to office hours if you have any questions about this proof. Theorem 1.1. There are exactly
More informationGraph 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
More informationConnectivity. 5.1 Cut Vertices. Handout #Ch5 San Skulrattanakulchai Gustavus Adolphus College Oct 27, MCS236: Graph Theory
MCS236: Graph Theory Handout #Ch5 San Skulrattanakulchai Gustavus Adolphus College Oct 27, 2010 Connectivity 5.1 Cut Vertices Definition 1. A vertex v in a connected graph G is a cut vertex if G v is
More informationMathematics 1. Part I: Graph Theory. Exercises and problems
Bachelor Degree in Informatics Engineering Barcelona School of Informatics Mathematics 1 Part I: Graph Theory Exercises and problems February 2015 Departament de Matemàtica Aplicada 2 Universitat Politècnica
More informationChapter 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.
More informationDiscrete Mathematics (Math 510) Fall Definitions and Theorems
Discrete Mathematics (Math 510) Fall 2014 Definitions and Theorems Gerald Hoehn October 12, 2014 Chapter 1 Graph Theory 1.1 Basics Definition 1.1. A graph G is an ordered pair (V,E) of disjoint finite
More informationOutline 1.1 Graphs and Digraphs 1.2 Common Families of Graphs 1.4 Walks and Distance 1.5 Paths, Cycles, and Trees
GRAPH THEORY LECTURE 1 INTRODUCTION TO GRAPH MODELS Abstract. Chapter 1 introduces some basic terminology. 1.1 is concerned with the existence and construction of a graph with a given degree sequence.
More informationMIDTERM MATH 38, SPRING 2012 SOLUTIONS
MIDTERM MATH 38, SPRING 2012 SOLUTIONS 1. [20 points] (a) Prove that if G is a simple graph of order n such that (G) + δ(g) n 1, then G is connected. (Hint: Consider a vertex of maximum degree.) (b) Show
More informationDefinition A tree is a connected, acyclic graph. Alternately, a tree is a graph in which any two vertices are connected by exactly one simple path.
11.5 Trees Examples Definitions Definition A tree is a connected, acyclic graph. Alternately, a tree is a graph in which any two vertices are connected by exactly one simple path. Definition In an undirected
More informationHomework 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
More informationGRAPH CONNECTIVITY. 9 Elementary Properties
9 Elementary Properties 30 GRAPH CONNECTIVITY 9 Elementary Properties Definition 9.1: A graph G is said to be connected if for every pair of vertices there is a path joining them. The maximal connected
More informationGraph Theory. 1.1 Graph: Prepared by M. Aurangzeb Updated: Monday, March 15, 2010
Prepared by M. Aurangzeb Updated: Monday, March 15, 2010 Graph Theory Graph theory is the branch of mathematics which deals with entities and their mutual relationships. The entities are represented by
More informationModule 3. Trees. Contents
Module Trees Contents. Definitions and characterizations............... Number of trees (Optional)................. 5 Cayley s formula........................ Kirchoffmatrixtree theorem.................
More information1.5 Problems and solutions
15 PROBLEMS AND SOLUTIONS 11 15 Problems and solutions Homework 1: 01 Show by induction that n 1 + 2 2 + + n 2 = n(n + 1)(2n + 1) 01 Show by induction that n 1 + 2 2 + + n 2 = n(n + 1)(2n + 1) We ve already
More informationIn this section, we shall assume (except where noted) that graphs are loopless.
6 Graph Colouring In this section, we shall assume (except where noted) that graphs are loopless. Upper and Lower Bounds Colouring: A kcolouring of a graph G is a map φ : V (G) S where S = k with the
More informationGraph. Notation: E = * *1, 2+, *1, 3+, *2, 3+, *3, 4+ +
Graph graph is a pair (V, E) of two sets where V = set of elements called vertices (singl. vertex) E = set of pairs of vertices (elements of V) called edges Example: G = (V, E) where V = *,,, + E = * *,
More informationSolutions 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.
More information1 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
More informationDefinitions and examples
Chapter 1 Definitions and examples I hate definitions! Benjamin Disraeli In this chapter, we lay the foundations for a proper study of graph theory. Section 1.1 formalizes some of the graph ideas in the
More informationGraph Theory and Metric
Chapter 2 Graph Theory and Metric Dimension 2.1 Science and Engineering Multi discipline teams and multi discipline areas are words that now a days seem to be important in the scientific research. Indeed
More informationGRAPH THEORY: INTRODUCTION
GRAPH THEORY: INTRODUCTION DEFINITION 1: A graph G consists of two finite sets: a set V (G) of vertices a set E(G) of edges, where each edge is associated with a set consisting of either one or two vertices
More informationMTH 548 Graph Theory Fall 2003
MTH 548 Graph Theory Fall 2003 Lesson 6  Planar graphs Planar graph plane drawing  plane graph face length of a face infinite face Thm 12: Euler. Let G be a plane drawing of a connected planar graph.
More informationNeighborhood Unions and Independent Cycles
Neighborhood Unions and Independent Cycles Ronald J. Gould Kazuhide Hirohata Paul Horn Abstract In this paper, we investigate sufficient conditions on the neighborhood of independent vertices which imply
More informationGraph 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
More informationGraph. Graph Theory. Adjacent, Nonadjacent, Incident. Degree of Graph
Graph Graph Theory Peter Lo A Graph (or undirected graph) G consists of a set V of vertices (or nodes) and a set E of edges (or arcs) such that each edge e E is associated with an unordered pair of vertices.
More information(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
More informationThe University of Sydney MATH2009
The University of Sydney MATH2009 GRAPH THEORY Tutorial Solutions 200 1. Find a solution to the hinese Postman Problem in this graph, given that every edge has equal weight. The problem is to find the
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationSubgraphs and Paths and Cycles
15 October, 2015 Subgraphs Definition Let G = (V, E) be a graph. Graph H = (V, E ) is a subgraph of G if V V and E E. Subgraphs Definition Let G = (V, E) be a graph. Graph H = (V, E ) is a subgraph of
More informationThe number of edges in a bipartite graph of given radius
The number of edges in a bipartite graph of given radius P. Dankelmann, Henda C. Swart, P. van den Berg University of KwaZuluNatal, Durban, South Africa Abstract Vizing established an upper bound on the
More informationGraph theory. PoShen Loh. June 2012
Graph theory PoShen Loh June 2012 At first, graph theory may seem to be an ad hoc subject, and in fact the elementary results have proofs of that nature. The methods recur, however, and the way to learn
More informationMATH 2420 Discrete Mathematics Lecture notes
MATH 2420 Discrete Mathematics Lecture notes Graphs Objectives Graphs 1. Identify loops, parallel edges, etc. in a graph. 2. Draw the complete graph on n vertices, and the complete bipartite graph on (m,n)
More informationGRAPH 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.
More informationForests 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).
More informationMAD 3105 PRACTICE TEST 2 SOLUTIONS
MAD 3105 PRACTICE TEST 2 SOLUTIONS 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ r s t u v w x y z
More informationOn the minimal length of the longest trail in a fixed edgedensity graph
Cent Eur J Math 11(10 013 18311837 DOI: 10478/s11533013085x Central European Journal of Mathematics On the minimal length of the longest trail in a fixed edgedensity graph Research Article Vajk Szécsi
More informationDiscrete 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
More information3. Representing Graphs and Graph Isomorphism. Discussion
3. REPRESENTING GRAPHS AND GRAPH ISOMORPHISM 195 3. Representing Graphs and Graph Isomorphism 3.1. Adjacency Matrix. Definition 3.1.1. The adjacency matrix, A = [a ij ], for a simple graph G = (V, E),
More informationGraph Theory. Problems Booklet. (Math415) dr. j. preen
Graph Theory (Math415) Problems Booklet dr. j. preen University College of Cape Breton Math415 Graph Theory Summer 2003 Time : at least 12 hours Q1. Draw the following graph: V (G) := {t, u, v, w, x, y,
More informationConnectivity. Definition 1 A separating set (vertex cut) of a connected G is a set S V (G) such that G S has more than one component.
Connectivity Definition 1 A separating set (vertex cut) of a connected G is a set S V (G) such that G S has more than one component. The connectivity, κ(g), is the minimum size of a vertex set S such that
More informationSquare Root Finding In Graphs
Square Root Finding In Graphs Majid Karimi, Master of Science Mathematics and Statistics Submitted in partial fulfilment of the requirements for the degree of Master of Science Faculty of Mathematics and
More informationGIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS
GIRTH SIX CUBIC GRAPHS HAVE PETERSEN MINORS Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA P. D. Seymour Bellcore 445 South St. Morristown,
More informationBasic 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
More informationMAP363 Combinatorics Answers 1
MAP6 Combinatorics Answers Guidance on notation: graphs may have multiple edges, but may not have loops. A graph is simple if it has no multiple edges.. (a) Show that if two graphs have the same degree
More informationExcluding pairs of graphs
Excluding pairs of graphs Maria Chudnovsky 1 Columbia University, New York, NY 10027, USA Alex Scott Mathematical Institute, University of Oxford, 2429 St Giles, Oxford OX1 3LB, UK Paul Seymour 2 Princeton
More informationHOMEWORK 3. e 1 K 1 K 2 SOLUTIONS
HOMEWORK 3 SOLUTIONS (1) Show that for each n N the complete graph K n is a contraction of K n,n. Solution: We describe the process for several small values of n. In this way, we can discern the inductive
More information10. 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
More informationTheorem 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
More informationChapter 5 Cycles and Circuits
Chapter 5 Cycles and Circuits Section 5.1 Eulerian Graphs Probably the oldest and best known of all problems in graph theory centers on the bridges over the river Pregel in the city of Kȯ. nigsberg (presently
More informationJANUSZ ADAMUS. for every pair of nonadjacent vertices x and y, then G contains a cycle of length n k, unless G is bipartite and n k 1 (mod 2).
A NOTE ON A DEGREE SUM CONDITION FOR LONG CYCLES IN GRAPHS arxiv:0711.4394v1 [math.co] 28 Nov 2007 JANUSZ ADAMUS Abstract. We conjecture that a graph of order n, in which d(x)+d(y) n k for every pair of
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: 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
More informationCombinatorics: 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
More information2. Graph Terminology
2. GRAPH TERMINOLOGY 186 2. Graph Terminology 2.1. Undirected Graphs. Definitions 2.1.1. Suppose G = (V, E) is an undirected graph. (1) Two vertices u, v V are adjacent or neighbors if there is an edge
More informationChapter 5. Connectivity. 5.1 Introduction
Chapter 5 Connectivity 5.1 Introduction The (strong) connectivity corresponds to the fact that a (directed) (u, v)path exists for any pair of vertices u and v. However, imagine that the graphs models
More informationVertex colouring and chromatic polynomials
Vertex colouring and chromatic polynomials for Master Course MSM380 Dong Fengming National Institute of Education Nanyang Technological University Contents 1 Vertex Colourings 1 1.1 Definition...............................
More informationOn 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
More informationBipartite Graphs and Problem Solving
Bipartite Graphs and Problem Solving Jimmy Salvatore University of Chicago August 8, 2007 Abstract This paper will begin with a brief introduction to the theory of graphs and will focus primarily on the
More informationChapter 5: Connectivity Section 5.1: Vertex and EdgeConnectivity
Chapter 5: Connectivity Section 5.1: Vertex and EdgeConnectivity Let G be a connected graph. We want to measure how connected G is. Vertex cut: V 0 V such that G V 0 is not connected Edge cut: E 0 E
More informationSolutions to Exercises Chapter 11: Graphs
Solutions to Exercises Chapter 11: Graphs 1 There are 34 nonisomorphic graphs on 5 vertices (compare Exercise 6 of Chapter 2). How many of these are (a) connected, (b) forests, (c) trees, (d) Eulerian,
More informationMinimal forbidden sets for degree sequence characterizations
University of Rhode Island DigitalCommons@URI Mathematics Faculty Publications Mathematics 2015 Minimal forbidden sets for degree sequence characterizations Michael D. Barrus University of Rhode Island,
More informationMTH 548 Graph Theory Fall 2003 Lesson 4  Paths and Cycles Walk, Trail, Path length= number of edges Connected graph, components circuit=closed
MTH 548 Graph Theory Fall 2003 Lesson 4  Paths and Cycles Walk, Trail, Path length= number of edges Connected graph, components circuit=closed trail, cycle=closed path Thm 3: u, vwalk implies u, vpath.
More informationIn example: V(G) = {a,b,c,d,e,f,g}, E(G) = {u,v,w,x,y}, ψ G maps a uv (i.e. ψ G (a) = {u,v} = uv), b vw, c vx, d wy, e wy, f xy.
BASIC GRAPH THEORY DEFINITIONS If book and instructor disagree, follow instructor! Graphs graph G consists of vertex set V(G), edge set E(G), incidence relation ψ G mapping each edge to unordered pair
More informationSection 7.4 Connectivity. We extent the notion of a path to undirected graphs. An informal definition (see the text for a formal definition):
Section 7.4 Connectivity We extent the notion of a path to undirected graphs. An informal definition (see the text for a formal definition): There is a path v0, v1, v2,..., vn from vertex v0 to vertex
More informationIntroduction 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
More informationThis is an on going project. Use at your own risk. There are bound to be typos. Corrections are appreciated, and rewarded with small amounts of extra
Graph Theory Notes This is an on going project. Use at your own risk. There are bound to be typos. Corrections are appreciated, and rewarded with small amounts of extra credit, especially when they indicate
More informationGraph theory. PoShen Loh. June We begin by collecting some basic facts which can be proved via barehands techniques.
Graph theory PoShen Loh June 011 1 Wellknown results We begin by collecting some basic facts which can be proved via barehands techniques. 1. The sum of all of the degrees is equal to twice the number
More informationGraph 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.
More informationChapter 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:
More information4 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
More informationPartitioning edgecoloured complete graphs into monochromatic cycles and paths
arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edgecoloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political
More informationGraphs. Discrete Mathematics (MA 2333) Faculty of Science Telkom Institute of Technology Bandung  Indonesia
Graphs Discrete Mathematics (MA 2333) Faculty of Science Telkom Institute of Technology Bandung  Indonesia Introduction Graph theory is an old subject with many modern applications. Its basic idea were
More informationCourse Notes for CS336: Graph Theory
Course Notes for CS336: Graph Theory Jayadev Misra The University of Texas at Austin 5/11/01 Contents 1 Introduction 1 1.1 Basics................................. 2 1.2 Elementary theorems.........................
More information1.7. Isomorphic Graphs
1.7. Isomorphic Graphs Example: Consider the following graphs, are they the isomorphic, i.e. the same? No. The lefthand graph has 5 edges; the right hand graph has 6 edges. WUCT121 Graphs 25 Firstly,
More informationGRAPH 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
More informationTheorems Matching (independent) edge set A perfect matching edge cover Vertex cover Shadow
Theorems Matching (independent) edge set in agraphis a set ofedges without commonvertices. Aperfect matching is a matching which matches all vertices of the graph. That is, every vertex of the graph isincidentto
More informationAbout the Tutorial. Audience. Prerequisites. Disclaimer & Copyright
About the Tutorial This tutorial offers a brief introduction to the fundamentals of graph theory. Written in a readerfriendly style, it covers the types of graphs, their properties, trees, graph traversability,
More informationMULTIPLE CHOICE QUESTIONS. 1) Let A and B be any two arbitrary events then which one of the following is true?
DISCRETE SRUCTURES MULTIPLE CHOICE QUESTIONS 1) Let A and B be any two arbitrary events then which one of the following is true? a. P( A intersection B) = P(A). P(B) b. P(A union B) = P(A) + P(B) c. P(AB)
More informationPlanar 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
More informationDecomposition of cartesian products of regular graphs into isomorphic trees
Decomposition of cartesian products of regular graphs into isomorphic trees Kyle F. Jao, Alexandr V. Kostochka, and Douglas B. West August 28, 2012 Abstract We extend the ideas of Snevily and Avgustinovitch
More informationFriendship twographs
DIMACS Technical Report 200814 November 2008 Friendship twographs by Endre Boros 1 RUTCOR, Rutgers Center for Operations Research Rutgers, The State University of New Jersey 640 Bartholomew Road, Piscataway,
More information3. 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
More informationChapter 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
More informationGraph 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
More informationOrdering without forbidden patterns
Ordering without forbidden patterns Pavol Hell Bojan Mohar Arash Rafiey Abstract Let F be a set of ordered patterns, i.e., graphs whose vertices are linearly ordered. An Ffree ordering of the vertices
More informationVERTEX DEGREES IN PLANAR GRAPHS
VERTEX DEGREES IN PLANAR GRAPHS Douglas B. West Department of Mathematics University of Illinois Urbana, Illinois 6101 Todd Will Department of Mathematics University of Illinois Urbana, Illinois 6101 Abstract
More informationDO NOT REDISTRIBUTE 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
More informationFigure 1: A Planar Drawing of K 4. Figure 2: A Planar Drawing of K 5 minus one edge
1 Planar Graphs 1.1 Plane Drawings A plane drawing of a graph is a drawing of the graph in the plane such that edges only meet and at their endpoints. A graph is planar if it admits a plane drawing. For
More informationRegular bipartite graphs are antimagic
Regular bipartite graphs are antimagic Daniel W. Cranston Abstract A labeling of a graph G is a bijection from E(G) to the set {1, 2,..., E(G) }. A labeling is antimagic if for any distinct vertices u
More informationGraphs with 1Factors
University of South Carolina Scholar Commons Faculty Publications Mathematics, Department of 111974 Graphs with 1Factors David Sumner University of South Carolina  Columbia, sumner@math.sc.edu Follow
More informationCS173 Lecture B, November 17, 2015
CS173 Lecture B, November 17, 2015 Tandy Warnow November 17, 2015 CS 173, Lecture B November 17, 2015 Tandy Warnow Today s material Adjacency matrices and adjacency lists (and a class exercise) Depthfirst
More informationHOMEWORK 4 SOLUTIONS. We then drop the leading 1 in the code and put 2 at the back of the code:
HOMEWORK 4 SOLUTIONS (1) Draw the tree whose Prüfer code is (1, 1, 1, 1, 6, 5) Solution: The given Prüfer code has six entries, therefore the corresponding tree will have 6 + = 8 entries The first number
More informationPlanarity 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?
More information1 Introduction to Graph Theory
CHAPTER 1 Introduction to Graph Theory INTRODUCTION It is no coincidence that graph theory has been independently discovered many times, since it may quite properly be regarded as an area of applied mathematics.
More information(Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?
Vertex Coloring 2.1 37 (Vertex) Colorings Definition: A coloring of a graph G is a labeling of the vertices of G with colors. [Technically, it is a function f : V (G) {1, 2,..., c}.] Definition: A proper
More information5.1. Hamilton cycles and Hamilton paths. 5. Hamiltonian Graphs
5. Hamiltonian Graphs The Traveling Salesman Problem. Hamiltonian paths and hamiltonian cycles. Characterization os hamiltonian graphs. The closure of a graph. Chvatals theorem for hamiltonicity. Erd schvatals
More information