MT365 Examination 2007 Part 1. Q1 (a) (b) (c) A
|
|
- Ralph Gardner
- 5 years ago
- Views:
Transcription
1 MT6 Examination Part Solutions Q (a) (b) (c) F F F E E E G G G G is both Eulerian and Hamiltonian EF is both an Eulerian trail and a Hamiltonian cycle. G is Hamiltonian but not Eulerian and EF is a Hamiltonian cycle. G is Eulerian but not Hamiltonian and EF is an Eulerian trail. Q (a) The number of edges in G =. The sum of the vertex degrees in G = = 6 Since the sum of the vertex degrees (6) is equal to twice the number of edges ( ) the handshaking lemma is verified (b) simple connected graph with the same degree sequence as G is Q basic network equivalent to the given network is S 9 S S 6 T T T Noel Eastham
2 Q (a) (i) {,,,, E, F} is a triangle (ii) {,,, E, F} is a pentagon (b) (i) {,,, F} is a set of four points whose convex hull is a triangle (ii) {,,. E} is a set of four points whose convex hull is a quadrilateral Q (a) Using Kruskal s algorithm and selecting edges in the order (), E(), E(), E() gives the minimum connector E (b) Using Prim s algorithm and selecting edges in the order E(), (), (), E() gives the minimum connector E or E Q6 (a) The first fit packing method gives an answer of workers as follows F E 9 G 6 H W W W W W (b) The first fit decreasing packing method gives an answer of workers as follows E 9 G F 6 H W W W W MT6 Exam Solutions Noel Eastham Page of
3 Q (a) The interchange graph for the system is 6 (b) The mobility of the system considered as a planar kinematic system containing only revolute pairs is determined by noting the number of links n = and the number of joints j = M = (n ) j = ( ) = = = Q (a) Since there are x vertices of degree, y vertices of degree 6 and z vertices of degree The total number of vertices v is given by v = x + y + z The total number of edges e is given by e = x + 6y + z so e = x + y + z The total number of faces f is given by f = e so f x y z (b) Using Euler s formula v e + f = we obtain x y z x y z x y z x + y + z 6x 9y z + x + 6y + z = 6 x z = 6 and so x = 6 + z as required Q9 a w w x y z 6 a b x 6 b 6 c y c d 6 d z First revised cost matrix First Partial graph MT6 Exam Solutions Noel Eastham Page of
4 Q(a) The five remaining codewords are found by forming all possible sums of the three given,,,, (b) The minimum distance = since this is the smallest weight of a non-zero codeword. Hence the code can detect two errors and correct a single error. Q(a) a (b) a b f b f c e c e d depth first search spanning tree d breadth first search spanning tree Q(a) t c (b) t so c f I t c Q(a) v = 9, b =, k =, r = (b) is a resolvable design with replicates 6 9 G F E E F F E E H H I G I G H G I H F I (c) is a balanced design since (v ) = r (k ) gives = and so = MT6 Exam Solutions Noel Eastham Page of
5 Part Q(a) The chromatic number (G) since the maximum vertex degree is by rooks Theorem. The chromatic number (G) since G contains a cycle of length. So (G) = n explicit colouring of G with three colours is or (b) plane drawing of G is (c) The chromatic index '(G) = since a -edge colouring is given below and an edge colouring with fewer colours is impossible since the degrees of all of the vertices is. or The bounds given by Vizing s theorem are d '(G) d + where d is the maximum vertex degree, which in this case is and so '(G) and the chromatic index is equal to the lower bound. (d) The Independence number of G is 6. We obtain a lower bound for ind(g) from the condition (G) ind(g) n where n is the number of vertices. In this case it gives ind(g) 6, so ind(g) 6/ or ind(g) 6 since ind(g) is an integer. n upper bound for ind(g) comes from the outer cycle of length in G. Four alternate vertices in this cycle, such as those coloured red or () above, are adjacent to all others in the cycle and to four vertices in one of the inner squares, but are not adjacent to any of the vertices in the other inner square. Two vertices from opposite corners of the other inner square, coloured red or () again, are independent. Together these 6 vertices form a maximal set of independent vertices in G and so ind(g) 6. MT6 Exam Solutions Noel Eastham Page of
6 Q(a) pruned quad tree that stores the given image is (b) path arising from the steps of the north neighbour algorithm starting at the pixel in rc6 is North Neighbour rc6 Start Vertex rc6 (c) (d) The columns,,, are shifted right to become columns, 6,, and vice versa. In the pruned quad tree above, at the level directly below the root, we label the vertices as,, and. In order to produce the quad tree for the new image the subtrees rooted at and are interchanged and the subtrees rooted at and are interchanged. No changes at all are made within any of the subtrees themselves. If we count the root as level then the screen image above has a pruned quad tree with levels and we are interchanging subtrees rooted at level. In screen image if we exchange columns,,, with columns, 6,, and also columns 9,,, with columns,,, 6 then the associated quad tree has levels counting the root as level. In this case we leave level alone but we perform the same interchange of subtrees rooted at with and with at level as in the diagram below. MT6 Exam Solutions Noel Eastham Page 6 of
7 This essay is just one version of what could be produced; it is more detailed than would be expected and is included to provide an overview of the topic as well as an example. Q6 tree is a connected graph with no cycles. Trees can be labelled or unlabelled, possibly rooted and if so possibly binary. rooted tree has one vertex designated as the root vertex, with branches fanning out from it; if at most two branches arise from a vertex in a rooted tree then the tree is referred to as a binary tree. ounting graphs with particular properties can often be difficult but since trees are one of the simplest types of graphs, many tree counting problems can be solved. These solutions have important uses since trees often model real practical situations. Unlabelled trees can model organic molecules; counting the number of unlabelled trees on six vertices allows the enumeration of the number of organic molecules with the formula 6 H. Labelled trees can model the expansion of a multiple kinematic joint; the number of labelled trees on four vertices enumerates the number of ways of expanding a quaternary joint into binary joints. Labelled trees with n vertices can be counted by constructing a one one correspondence with a Prüfer Sequence. Prüfer Sequence is a list of n numbers, any one of which may take n values. The one-one correspondence is made in two stages. Firstly a given labelled tree with n vertices can be converted to a Prüfer Sequence by finding the vertex of degree one with the smallest vertex label, writing down the label of the vertex to which this is joined and then removing this vertex of degree one and its corresponding branch. This process is repeated until a single branch joining two vertices remains. This produces a list of n numbers, the Prüfer Sequence. onversely, a Prüfer Sequence can be converted to a labelled tree by finding the smallest number in the list of numbers to n not in the sequence, labelling a vertex with that number and joining it by an edge to a vertex with a label given by the first number in the Prüfer Sequence. These numbers are then removed from the list and the sequence and the process repeated until just two numbers remain in the list, when vertices with these labels are joined by an edge. Since there are n numbers in a Prüfer Sequence each of which can take n values, there are n n different Prüfer Sequences and so there are therefore n n labelled trees, this result is called ayley s Theorem. inary trees are rooted trees in which each vertex is of degree at most two. These are examples of unlabelled trees whose number can be found by the use of a recurrence relation. enote by u n the number of binary trees with n vertices. Such a binary tree either has a single edge emerging to the left from the root, a single edge emerging to the right from the root or two edges emerging from the root. If the numbers of these three types of binary tree are represented by a n, b n and c n then u n = a n + b n + c n. We can, by considering how such binary trees are formed from binary trees with fewer than n vertices build a recurrence relation for u n in terms of u n, u n,... u, u. Such a recurrence relation can be used to determine the number of unlabelled binary trees with n vertices. The method of deriving a recurrence relation can also be used to find the number of alkanes, a type of organic molecule, with the chemical formula n H n+. This was done for the first time by rthur ayley in the s. No unlabelled tree representing an alkane can have a vertex of degree more than four since this is the number of chemical bonds linking an individual carbon atom to its neighbours. In order to derive the recurrence relation ayley considered these trees as being of two types, either central or bicentral. central tree is one for which removal of all vertices of degree one and their associated branches in successive stages leaves at the end a single vertex. If there is a pair of vertices joined by a single edge left at the final stage the tree is called bicentral. ayley considered each tree as a rooted tree with the centre or bicentre as the root and built his recurrence relation by considering the rooted trees formed by removing the central or bicentral root. result first found by Georg Pólya in the 9s can be used to enumerate many types of graph including unlabelled trees with a particular number of vertices. Pólya s result is associated with Group Theory and uses a polynomial called the cycle index in order to complete the enumeration. MT6 Exam Solutions Noel Eastham Page of
8 Q For the following weighted digraph S 6 E F G H T (a) Each row of the following table corresponds to an iteration of the shortest path algorithm S E F G H T * The potentials are boxed above and were allocated in the order S(), (), (), (), E(), (), F(), H(), G(), T(). There are two shortest paths SEHT and SEHT both of length (b) Each row of the following table corresponds to an iteration of the longest path algorithm. The second row of the table indicates the vertices from which the vertex above is reachable. S E F G H T S S, S,E,,, F,E F,E G,H,,,9,,, 9,, The potentials are boxed above and were allocated in the order S(), (), (), (), F(), E(), (), H(), G(), T(). There is a single longest path SFEGT of length MT6 Exam Solutions Noel Eastham Page of
9 Q(a) Kirchhoff s current equation for vertex is i i i = or i + i i = Kirchhoff s voltage equation for cycle involving components, and is v + v + v = or v v v = (b) Each fundamental cycle contains a unique chord, the rest are branches. Each fundamental cutset contains a unique branch, the rest are chords. Thus two of the three edges,, are branches and one of the edges, is a branch. There are 6 possible spanning trees arising from choosing any two of the three edges,, in three ways with any one of the two edges, in two ways. The following are the six possibilities : {,, } {,, } {,, } {,, } {,, } {,, } (c) (i) Fundamental ycles are {,,, } or v + v + v + v = Fundamental utsets are {,, } or v + v + v = {, } or {, } i i = {,, } or {,, } i i i = {,, } or {,, } i i i = (ii) The five component equations are di v = V, v L dt, v = R i, v = R i, dv i dt (iii) The two state variables are the variables which are differentiated in the component equations. They are thus i and v and the state equations obtained by eliminating variables between the omponent, Fundamental ycle and Fundamental utset equations will involve these variables and their derivatives only. MT6 Exam Solutions Noel Eastham Page 9 of
10 This essay is just one version of what could be produced; it is more detailed than would be expected and is included to provide an overview of the topic as well as an example. Q9 Menger s theorem, in its various forms, is concerned with the number of different paths joining two vertices s and t in a connected graph or digraph. The paths can be edge or arc disjoint meaning they have no edges or arcs in common, or they can be vertex disjoint in which case they have no vertices in common with the exception of s and t. set of edges (or arcs) separating s from t is a set of edges (or arcs) whose removal from the graph destroys all paths from s to t. Similarly a set of vertices separating s from t is a set of vertices whose removal from the graph again destroys all paths from s to t. The edge form of Menger s Theorem for graphs states that the maximum number of edge disjoint st paths equals the minimum number of edges separating s from t. In a similar way, in a digraph, the maximum number of arc disjoint st paths equals the minimum number of arcs separating s from t. The result just quoted for digraphs can be proved as a consequence of the max flow min cut theorem. This is done by constructing a basic network from the digraph, by giving each arc a capacity of. Now a maximum flow from s to t must consist of a collection of flows of value along a set of arc disjoint paths and so the value of the maximum flow from s to t must equal the number of such arc disjoint paths from s to t. minimum cut in the basic network will be a minimum set of arcs separating s from t and the capacity of this cut will equal the number of arcs in the cut. Since the max flow min cut theorem states that the value of a maximum flow is equal to the capacity of a minimum cut it must therefore be the case that the number of arc disjoint st paths is equal to the number of arcs separating s from t, which is Menger s theorem for digraphs in its arc form. Menger s theorem for graphs in its edge form can be proved similarly by first introducing two arcs for each edge in the graph and applying Menger s theorem for digraphs. The vertex form of Menger s theorem states that the maximum number of vertex disjoint st paths is equal to the minimum number of vertices separating s from t. This is identical for graphs and digraphs and is proved for digraphs by introducing an arc of capacity replacing each vertex. rcs into the replaced vertex are directed into the start vertex of the replacement arc and arcs out of the replaced vertex are directed out of the finish vertex of the replacement arc. pplying the arc form of Menger s theorem for digraphs then enables us to prove the vertex form of Menger s theorem for digraphs. Finally the vertex form of Menger s theorem for graphs can be proved by performing both the transformations mentioned above, that is the replacement of each edge by two arcs and each vertex by an arc and then an application of the arc form of Menger s theorem. The edge connectivity of a connected graph is defined to be the smallest number of edges whose removal disconnects the graph. On applying Menger s theorem, this means there must be at least edge-disjoint paths joining any pair of vertices. This leads to a corollary of Menger s theorem which states that a connected graph has edge connectivity if and only if every pair of vertices are joined by or more edge-disjoint paths, and at least one pair of vertices is joined by exactly edge-disjoint paths. There is a corresponding result for the vertex connectivity This states that any connected graph, other than a complete graph, has vertex connectivity if and only if every pair of non-adjacent vertices are joined by or more vertex-disjoint paths and at least one non-adjacent pair of vertices is joined by exactly vertex-disjoint paths. These ideas are important in the design of reliable telecommunications networks. The edges of a graph represent the communication links while the vertices represent the exchanges or subscribers. telecommunication network will be reliable if, when a link or exchange is broken or fully occupied, there are alternative paths for communication between subscribers. The existence of alternative paths depends on the maximum number of edge disjoint paths between vertices and the maximum number of vertex disjoint paths between non adjacent vertices and so is related to the edge and vertex connectivity of the network. In practice to fully analyse the reliability of a telecommunication network we need information on all the cutsets as well as the edge and vertex connectivity. MT6 Exam Solutions Noel Eastham Page of
11 Q(a) onsider the octahedron Q E G 6 F H (i) The Incidence matrix of the incidence structure S whose points are the vertices and whose lines are the faces of Q is E F G H 6 (ii) The block table for S is E F G H (iii) The values of d p and d l are d p =, d l = (iv) The ube and Octahedron are dual polyhedra, vertices of the octahedron correspond to faces of the cube and faces of the octahedron correspond to vertices of the cube. The Incidence structure S* of the cube is the dual of the incidence structure S of the octahedron. S* is obtained by interchanging the roles of points and lines in S. So S (P, L) becomes S*(L, P) which is the incidence structure of the cube. The incidence matrix of the incidence structure S* of the cube is the transpose T of the incidence matrix of the incidence structure of the octahedron (b) (i) The completed table is n vn en dn 6 6 (ii) The handshaking lemma states the sum of the vertex degrees equals twice the number of edges so vndn e n hence en vndn n (n ) n(n ) MT6 Exam Solutions Noel Eastham Page of
12 Q(a) (i) Length n =, imension k =, Rate = k/n = / = / Minimum distance = (smallest weight of a non-zero codeword) so the code can correct error and detect errors. G 6 G 6 H 6 H 6 (b) (i) T I M The codewords for T, I and M are the first, second and last rows of the final matrix (ii) J O E This calculation can be understood as follows. The product of the Parity heck matrix H with the three received words produces a set of three error syndromes in the columns of the central matrix. These indicate errors in the rd bit of the first word, the sixth bit of the second word and no error in the last word. These errors are corrected (in red) to produce a set of three correct codewords. The Generator matrix G has the columns of the unit sub matrix in its rd, th, 6th and th columns so taking the rd, th, 6th and th bits of the codewords (as underlined) generates the message bits of the symbols of the message. These have been written in columns in the final matrix so enabling decoding of the message words to proceed easily and produce the message JOE. MT6 Exam Solutions Noel Eastham Page of
13 This essay is just one version of what could be produced; it is more detailed than would be expected and is included to provide an overview of the topic as well as an example. Q Latin square is an n n square array of n symbols in which each symbol occurs once in each row and column. Some examples of size, and are There are various methods of constructing Latin squares; the simplest methods are the cyclic construction and a construction using Steiner triples. The cyclic construction is seen in the Latin squares above where the symbols are shifted one place to the right in each successive row. This construction can be extended by moving the symbols r places to the right and the last r symbols to the front, r and n must have no common factor but if n is prime then r can have any value from to n. Latin squares can also be constructed by using a Steiner triple system. Given a Steiner triple system with n varieties label the rows and columns of the Latin square with these n varieties and put each of them in the corresponding diagonal position. Then for every position in the Latin square labelled by X and Y find the triple containing X and Y in the Steiner triple system and place the other symbol Z in that triple in the position labelled by X and Y in the Latin square. Latin squares are useful in the design of experiments particularly for situations in which there are two types of block which cross each other. Such a situation occurs in the testing of say four drugs,, and which are to be given to four patients over four three month periods. The Latin square above could be used for this experiment where the rows correspond to patients and the columns to each of the three month periods. Latin squares have properties which make them suitable for situations in which each block is complete (i.e. contains all varieties), each block of one type has exactly one plot in common with each block of the other type and each block of each type has the same number of plots as there are varieties. Two Latin squares are orthogonal if when one is placed directly over the other each of the n ordered pairs of symbols occur once and once only. Thus the two Latin squares are orthogonal since contains all n pairs once Such a set of orthogonal Latin squares are very useful in the construction of resolvable designs. resolvable design is one in which the blocks of the design can be grouped into replicates, a replicate being a set of plots containing each variety exactly once. Thus given a set of 6 varieties arranged in a square array as follows we can construct two replicates by using the rows and columns of the square array of numbers and two more by choosing those numbers in the same position as a particular letter in each of the Latin squares above. Finally Latin squares also have applications in the theory of error correcting codes and in edge colourings of complete bipartite graphs K n,n. These arise from an alternative way of describing a Latin square as a list of n triples (I, j, k) where i, j, and k are the row, column and symbol numbers associated with the Latin square. MT6 Exam Solutions Noel Eastham Page of
14 Essay Outlines Q6. Introduction definition of a tree types of trees. pplications of tree counting problems labelled and unlabelled trees. ounting labelled trees Prüfer Sequences. ounting binary trees by use of recurrence relations. ounting chemical trees central and bicentral trees. onclusion Pólya s counting theorem. Q9. Introduction edge disjoint and vertex disjoint paths separating s from t. Menger s Theorem for Graphs and igraphs edge and arc form. Proof of Menger s Theorem for igraphs Max-flow min-cut theorem. Menger s Theorem for Graphs and igraphs vertex form. orollaries of Menger s Theorem edge and vertex connectivity. onclusion application to telecommunication networks. Q. Introduction definition of a Latin Square onstruction of Latin Squares cyclic and Steiner triple constructions Uses of Latin Squares Orthogonal Latin Squares Uses of orthogonal Latin Squares. onclusion applications of Latin Square to odes and colourings. MT6 Exam Solutions Noel Eastham Page of
Part 1. Twice the number of edges = 2 9 = 18. Thus the Handshaking lemma... The sum of the vertex degrees = twice the number of edges holds.
MT6 Examination 16 Q1 (a) Part 1 Part1 Solutions (b) egree Sequence (,,,,, ) (c) Sum of the vertex degrees = + + + + + = 18 Twice the number of edges = 9 = 18. Thus the Handshaking lemma... The sum of
More informationMT365 Examination 2017 Part 1 Solutions Part 1
MT xamination 0 Part Solutions Part Q. G (a) Number of vertices in G =. Number of edges in G = (i) The graph G is simple no loops or multiple edges (ii) The graph G is not regular it has vertices of deg.,
More informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 2 (Week 9) 2008
The University of Sydney MATH99/09 Graph Theory Tutorial (Week 9) 00. Show that the graph on the left is Hamiltonian, but that the other two are not. To show that the graph is Hamiltonian, simply find
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More informationIntroductory Combinatorics
Introductory Combinatorics Third Edition KENNETH P. BOGART Dartmouth College,. " A Harcourt Science and Technology Company San Diego San Francisco New York Boston London Toronto Sydney Tokyo xm CONTENTS
More informationMAS 341: GRAPH THEORY 2016 EXAM SOLUTIONS
MS 41: PH THEOY 2016 EXM SOLUTIONS 1. Question 1 1.1. Explain why any alkane C n H 2n+2 is a tree. How many isomers does C 6 H 14 have? Draw the structure of the carbon atoms in each isomer. marks; marks
More informationMathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4
1. Draw Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4 (i) a simple graph. A simple graph has a non-empty vertex set and no duplicated edges. For example sketch G with V
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationDegree of nonsimple graphs. Chemistry questions. Degree Sequences. Pigeon party.
1. WEEK 1 PROBLEMS 1.1. Degree of nonsimple graphs. In the lecture notes we defined the degree d(v) of a vertex v to be the number of vertices adjacent to v. To see why Euler s theorem doesn t hold for
More informationCS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationApplied Combinatorics
Applied Combinatorics SECOND EDITION FRED S. ROBERTS BARRY TESMAN LßP) CRC Press VV^ J Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Group an informa
More informationTopic 10 Part 2 [474 marks]
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationGraph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow
Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /
More informationGraph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
More informationMATH 350 GRAPH THEORY & COMBINATORICS. Contents
MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles
More informationAssignment 1 Introduction to Graph Theory CO342
Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationProposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.
Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)
More informationBHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI Department of Science and Humanities CS6702-GRAPH THEORY AND APPLICATION
BHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI 635 854 Department of Science and Humanities DEGREE/BRANCH : B.E. CSE YEAR/ SEMESTER : IV/VII. CS6702-GRAPH THEORY AND APPLICATION 1. Define graph. UNIT-I
More informationIntroduction to. Graph Theory. Second Edition. Douglas B. West. University of Illinois Urbana. ftentice iiilil PRENTICE HALL
Introduction to Graph Theory Second Edition Douglas B. West University of Illinois Urbana ftentice iiilil PRENTICE HALL Upper Saddle River, NJ 07458 Contents Preface xi Chapter 1 Fundamental Concepts 1
More information4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar.
UPPSALA UNIVERSITET Matematiska institutionen Anders Johansson Graph Theory Frist, KandMa, IT 010 10 1 Problem sheet 4 Exam questions Solve a subset of, say, four questions to the problem session on friday.
More information1 Maximum Degrees of Iterated Line Graphs
1 Maximum Degrees of Iterated Line Graphs Note. All graphs in this section are simple. Problem 1. A simple graph G is promising if and only if G is not terminal. 1.1 Lemmas Notation. We denote the line
More information1. The following graph is not Eulerian. Make it into an Eulerian graph by adding as few edges as possible.
1. The following graph is not Eulerian. Make it into an Eulerian graph by adding as few edges as possible. A graph is Eulerian if it has an Eulerian circuit, which occurs if the graph is connected and
More information2 hours THE UNIVERSITY OF MANCHESTER. 23 May :45 11:45
2 hours MAT20902 TE UNIVERSITY OF MANCESTER DISCRETE MATEMATICS 23 May 2018 9:45 11:45 Answer ALL TREE questions in Section A (30 marks in total). Answer TWO of the TREE questions in Section B (50 marks
More informationAssignments are handed in on Tuesdays in even weeks. Deadlines are:
Tutorials at 2 3, 3 4 and 4 5 in M413b, on Tuesdays, in odd weeks. i.e. on the following dates. Tuesday the 28th January, 11th February, 25th February, 11th March, 25th March, 6th May. Assignments are
More informationThe University of Sydney MATH 2009
The University of Sydney MTH 009 GRPH THEORY Tutorial solutions 00. Show that the graph on the left is Hamiltonian, but that the other two are not. To show that the graph is Hamiltonian, simply find a
More informationMAS341 Graph Theory 2015 exam solutions
MAS4 Graph Theory 0 exam solutions Question (i)(a) Draw a graph with a vertex for each row and column of the framework; connect a row vertex to a column vertex if there is a brace where the row and column
More informationChapter 3: Paths and Cycles
Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week Eight Problems 1. Diagrams of all the distinct non-isomorphic trees on 6 or fewer vertices are listed in the lecture notes. Extend this list by drawing all
More informationArtificial Intelligence
Artificial Intelligence Graph theory G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/37 Outline 1 Graph theory Undirected and directed graphs
More informationDS UNIT 4. Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering Discrete Structutre UNIT - IV
Sr.No. Question Option A Option B Option C Option D 1 2 3 4 5 6 Class : S.E.Comp Which one of the following is the example of non linear data structure Let A be an adjacency matrix of a graph G. The ij
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationMATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise.
Final exam This is a closed book exam. No calculators are allowed. Unless stated otherwise, justify all your steps. You may use lemmas and theorems that were proven in class and on assignments unless stated
More information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationCharacterizations of Trees
Characterizations of Trees Lemma Every tree with at least two vertices has at least two leaves. Proof. 1. A connected graph with at least two vertices has an edge. 2. In an acyclic graph, an end point
More informationLecture 3: Graphs and flows
Chapter 3 Lecture 3: Graphs and flows Graphs: a useful combinatorial structure. Definitions: graph, directed and undirected graph, edge as ordered pair, path, cycle, connected graph, strongly connected
More informationOn the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments
Electronic Journal of Graph Theory and Applications 3 (2) (2015), 191 196 On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments Rafael Del Valle
More informationChapter 3 Trees. 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
More informationChapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings
Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition
More informationGraph Theory lecture notes
Graph Theory lecture notes 1 Definitions and examples 1 1 Definitions Definition 1.1. A graph is a set of points, called vertices, together with a collection of lines, called edges, connecting some of
More informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationGraph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
More informationLecture 4: Bipartite graphs and planarity
Lecture 4: Bipartite graphs and planarity Anders Johansson 2011-10-22 lör Outline Bipartite graphs A graph G is bipartite with bipartition V1, V2 if V = V1 V2 and all edges ij E has one end in V1 and V2.
More informationAlgorithms. Graphs. Algorithms
Algorithms Graphs Algorithms Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Algorithms 1 Graphs Vertices: Nodes, points, computers, users, items,...
More informationDiscrete mathematics II. - Graphs
Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,
More information5 Graphs
5 Graphs jacques@ucsd.edu Some of the putnam problems are to do with graphs. They do not assume more than a basic familiarity with the definitions and terminology of graph theory. 5.1 Basic definitions
More information1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G))
10 Graphs 10.1 Graphs and Graph Models 1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G)) 2. an edge is present, say e = {u,
More information2.) From the set {A, B, C, D, E, F, G, H}, produce all of the four character combinations. Be sure that they are in lexicographic order.
Discrete Mathematics 2 - Test File - Spring 2013 Exam #1 1.) RSA - Suppose we choose p = 5 and q = 11. You're going to be sending the coded message M = 23. a.) Choose a value for e, satisfying the requirements
More informationGRAPHS: THEORY AND ALGORITHMS
GRAPHS: THEORY AND ALGORITHMS K. THULASIRAMAN M. N. S. SWAMY Concordia University Montreal, Canada A Wiley-Interscience Publication JOHN WILEY & SONS, INC. New York / Chichester / Brisbane / Toronto /
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More informationVarying Applications (examples)
Graph Theory Varying Applications (examples) Computer networks Distinguish between two chemical compounds with the same molecular formula but different structures Solve shortest path problems between cities
More informationBrief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions
Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.
More informationGraph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011
Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationMathematics and Statistics, Part A: Graph Theory Revision Exercises: Sheet 3
Mathematics and Statistics, Part A: Graph Theory Revision Exercises: Sheet 3 1. Prove Caley s theorem. There are n n 2 distinct labelled trees on n vertices. (i) Sketch a tree with 11 edges and find the
More informationDiscrete Mathematics I So Practice Sheet Solutions 1
Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise
More informationAlgorithms: Graphs. Amotz Bar-Noy. Spring 2012 CUNY. Amotz Bar-Noy (CUNY) Graphs Spring / 95
Algorithms: Graphs Amotz Bar-Noy CUNY Spring 2012 Amotz Bar-Noy (CUNY) Graphs Spring 2012 1 / 95 Graphs Definition: A graph is a collection of edges and vertices. Each edge connects two vertices. Amotz
More informationAnswers to specimen paper questions. Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes.
Answers to specimen paper questions Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes. Question 1. (a) The degree of a vertex x is the number
More informationIntroduction to Graph Theory
Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /
More informationDiscrete Mathematics 2 Exam File Spring 2012
Discrete Mathematics 2 Exam File Spring 2012 Exam #1 1.) Suppose f : X Y and A X. a.) Prove or disprove: f -1 (f(a)) A. Prove or disprove: A f -1 (f(a)). 2.) A die is rolled four times. What is the probability
More informationModule 2: NETWORKS AND DECISION MATHEMATICS
Further Mathematics 2017 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationFurther Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationOrientations of Planar Graphs
Orientations of Planar Graphs Doc-Course Bellaterra March 11, 2009 Stefan Felsner Technische Universität Berlin felsner@math.tu-berlin.de Topics α-orientations Sample Applications Counting I: Bounds Counting
More information1 Some Solution of Homework
Math 3116 Dr. Franz Rothe May 30, 2012 08SUM\3116_2012h1.tex Name: Use the back pages for extra space 1 Some Solution of Homework Proposition 1 (Counting labeled trees). There are n n 2 different labeled
More informationGraphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
More informationCounting the number of spanning tree. Pied Piper Department of Computer Science and Engineering Shanghai Jiao Tong University
Counting the number of spanning tree Pied Piper Department of Computer Science and Engineering Shanghai Jiao Tong University 目录 Contents 1 Complete Graph 2 Proof of the Lemma 3 Arbitrary Graph 4 Proof
More informationMath 776 Graph Theory Lecture Note 1 Basic concepts
Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved
More informationChapter 11: Graphs and Trees. March 23, 2008
Chapter 11: Graphs and Trees March 23, 2008 Outline 1 11.1 Graphs: An Introduction 2 11.2 Paths and Circuits 3 11.3 Matrix Representations of Graphs 4 11.5 Trees Graphs: Basic Definitions Informally, a
More informationWeek 12: Trees; Review. 22 and 24 November, 2017
(1/24) MA284 : Discrete Mathematics Week 12: Trees; Review http://www.maths.nuigalway.ie/~niall/ma284/ 22 and 24 November, 2017 C C C C 1 Trees Recall... Applications: Chemistry Applications: Decision
More information1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This is from Bona Chapter 1 (1).
Math/CS 415 Combinatorics and Graph Theory Fall 2017 Prof. Readdy Homework Chapter 1 1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This
More informationLecture 1: Examples, connectedness, paths and cycles
Lecture 1: Examples, connectedness, paths and cycles Anders Johansson 2011-10-22 lör Outline The course plan Examples and applications of graphs Relations The definition of graphs as relations Connectedness,
More informationKey Graph Theory Theorems
Key Graph Theory Theorems Rajesh Kumar MATH 239 Intro to Combinatorics August 19, 2008 3.3 Binary Trees 3.3.1 Problem (p.82) Determine the number, t n, of binary trees with n edges. The number of binary
More informationSolving problems on graph algorithms
Solving problems on graph algorithms Workshop Organized by: ACM Unit, Indian Statistical Institute, Kolkata. Tutorial-3 Date: 06.07.2017 Let G = (V, E) be an undirected graph. For a vertex v V, G {v} is
More informationWeek 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017
(1/25) MA284 : Discrete Mathematics Week 8: The fundamentals of graph theory; Planar Graphs 25 and 27 October, 2017 1 Definitions 1. A graph 2. Paths and connected graphs 3. Complete graphs 4. Vertex degree
More informationCombinatorics: The Fine Art of Counting
Week Three Solutions Note: in these notes multiplication is assumed to take precedence over division, so 4!/2!2! = 4!/(2!*2!), and binomial coefficients are written horizontally: (4 2) denotes 4 choose
More informationTWO CONTRIBUTIONS OF EULER
TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention
More informationMT5821 Advanced Combinatorics
MT5821 Advanced Combinatorics 4 Graph colouring and symmetry There are two colourings of a 4-cycle with two colours (red and blue): one pair of opposite vertices should be red, the other pair blue. There
More informationStudent Name and ID Number. MATH 3012 Final Exam, December 11, 2014, WTT
MATH 3012 Final Exam, December 11, 2014, WTT Student Name and ID Number 1. Consider the 11-element set X consisting of the three capital letters {A, B, C} and the eight digits {0, 1, 2,..., 7}. a. How
More informationPractice Final Exam 1
Algorithm esign Techniques Practice Final xam Instructions. The exam is hours long and contains 6 questions. Write your answers clearly. You may quote any result/theorem seen in the lectures or in the
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationLecture 10,11: General Matching Polytope, Maximum Flow. 1 Perfect Matching and Matching Polytope on General Graphs
CMPUT 675: Topics in Algorithms and Combinatorial Optimization (Fall 2009) Lecture 10,11: General Matching Polytope, Maximum Flow Lecturer: Mohammad R Salavatipour Date: Oct 6 and 8, 2009 Scriber: Mohammad
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 informationGRAPH DECOMPOSITION BASED ON DEGREE CONSTRAINTS. March 3, 2016
GRAPH DECOMPOSITION BASED ON DEGREE CONSTRAINTS ZOÉ HAMEL March 3, 2016 1. Introduction Let G = (V (G), E(G)) be a graph G (loops and multiple edges not allowed) on the set of vertices V (G) and the set
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More information0.0.1 Network Analysis
Graph Theory 0.0.1 Network Analysis Prototype Example: In Algonquian Park the rangers have set up snowmobile trails with various stops along the way. The system of trails is our Network. The main entrance
More informationMatching and Planarity
Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of
More information4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...
Contents 1 Introduction... 1 1.1 What is Competitive Programming?... 1 1.1.1 Programming Contests.... 2 1.1.2 Tips for Practicing.... 3 1.2 About This Book... 3 1.3 CSES Problem Set... 5 1.4 Other Resources...
More informationMAT 145: PROBLEM SET 4
MAT 145: PROBLEM SET 4 DUE TO FRIDAY FEB 22 Abstract. This problem set corresponds to the sixth week of the Combinatorics Course in the Winter Quarter 2019. It was posted online on Friday Feb 15 and is
More informationScheduling, Map Coloring, and Graph Coloring
Scheduling, Map Coloring, and Graph Coloring Scheduling via Graph Coloring: Final Exam Example Suppose want to schedule some ;inal exams for CS courses with following course numbers: 1007, 3137, 3157,
More informationMAS 341: GRAPH THEORY 2016 EXAM SOLUTIONS
MAS 341: GRAPH THEORY 2016 EXAM SOLUTIONS 1. Question 1 Part i. There are many Hamiltonian cycles; e.g., ABLKJEDFIHGC. We now show that if we remove vertex D, the result G \ {D} is not hamiltonian. Note
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationLATIN SQUARES AND TRANSVERSAL DESIGNS
LATIN SQUARES AND TRANSVERSAL DESIGNS *Shirin Babaei Department of Mathematics, University of Zanjan, Zanjan, Iran *Author for Correspondence ABSTRACT We employ a new construction to show that if and if
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI Department of Computer Science and Engineering CS6702 - GRAPH THEORY AND APPLICATIONS Anna University 2 & 16 Mark Questions & Answers Year / Semester: IV /
More information11.9 Connectivity Connected Components. mcs 2015/5/18 1:43 page 419 #427
mcs 2015/5/18 1:43 page 419 #427 11.9 Connectivity Definition 11.9.1. Two vertices are connected in a graph when there is a path that begins at one and ends at the other. By convention, every vertex is
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 3 Definitions an undirected graph G = (V, E)
More information