BHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI Department of Science and Humanities CS6702-GRAPH THEORY AND APPLICATION
|
|
- Sydney Johns
- 5 years ago
- Views:
Transcription
1 BHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI Department of Science and Humanities DEGREE/BRANCH : B.E. CSE YEAR/ SEMESTER : IV/VII. CS6702-GRAPH THEORY AND APPLICATION 1. Define graph. UNIT-I (INTRODUCTION) PART-A 2. Define Loop. 3. Define Pseudo graph. 4. Define complete graph. 5. Define Regular graph. 6. State Fundamental theorem. 7. Show that the number of odd vertices is always even. 8. Define Bipartite graph. 9. Give an example for not isomorphic with 8 vertices. 10. Define Path. 11. Define Euler graphs. 12. Define Euler trail. 13. Define Hamiltonian path. 14. Define Tree. 15. Give all the non isomorphic graphs on 4 vertices. 16. Show that a Hamiltonian path is a spanning tree. 17. Define spanning tree. 18. Define Minimally connected graph. 19. Define Metric. 20. Define Rooted tree. 21. Define Binary tree. 22. What are the maximum and minimum height of a binary tree with 15 vertices. 23. Can you draw a tree with 3 vertices having degree 1,2,2.
2 24. Define walk, path and circuit in a graph (N/D-16). 25. What is meant by eccentricity? (N/D-16). 26. Define Euler graph. Show that an Euler graph is connected except for any isolated vertices the graph may have. (A/M-17) 27. Can there be a path longer than a Hamiltonian path (if any) in a simple, connected, undirected graph? Why? (A/M-17) PART-B 1. A simple graph with n vertices and k components can have atmost (n-k)(n-k+1)/2 edges. 2. A given connected graph G is an Euler graph iff all vertices of G are of even degree. 3. Let G be a simple connected graph. If there exists non adjacent vertices u and v such that d(u)+d(v) n, then G is Hamiltonian iff G+uv is Hamiltonian 4. Show that the number of vertices of odd degree in a graph is always even 5. State and prove Fundamental theorem. 6. A connected graph G contains Euler trail iff G contains atmost 2 vertices of odd degree. 7. State and prove Dirac theorem. 8. Prove that, there is one and only one path between every pair of vertices in a tree T. 9. Show that In a graph G, there is one and only one path between every pair of vertices, then G is a tree. 10. Show that a tree with n -vertices has n-1 edges 11. Show that In any tree, there are at least two pendant vertices. 12. Show that the maximum number of edges in a simple graph with n vertices is n(n 1)/2.(6) (N/D- 16) 13. Prove that if a graph has exactly two vertices of odd degree, there must be path joining these two vertices.(5) (N/D-16) 14. Prove that any two simple connected graphs with n vertices, all of degree two, are isomorphic. (5) (N/D-16) 15. Mention some of the properties of tree. (5) (N/D-16) 16. Prove that in any tree, there are atleast two pendant vertices. (5) (N/D-16) 17. Show that a Hamiltonian path is a spanning tree. (6) (N/D-16) 18. Define the following terms: Walk, Euler path, Hamiltonian path, Subgraph, Circuit, Complete graph. (6)(A/M-17) 19. From the given graph draw the following: (i)walk of length 6,(ii) Is this an Euler graph? give reasons,(iii)is there a Hamiltonian path for this graph? Give reasons,(iv) Find atleast two complete subgraphs. (10) (A/M-17) 20. List any five properties of trees. (6) (A/M-17)
3 21. Define eccentricity of a vertex V in a tree T and give an example tree and its eccentricity from the root. (10) (A/M-17) 1. Define spanning tree. 2. What is Branches and chords? 3. Define Rank and nullity. UNIT-II (TREES, CONNECTIVITY AND PLANARITY) 4. Show that a hamiltonian path is a spanning tree. 5. What is weighted graph? PART-A 6. State Max-Flow and Min cut theorem and give an example. 7. Define 2- isomorphism. 8. Define 1-isomorphism. 9. What is edge connectivity? 10. What is vertex connectivity? 11. Give an example of 1-isomorphic but not isomorphic graph. 12. Define cut set. 13. Define Fundamental cut-set. Give an example. 14. Define Separability. 15. Define planar Graph. 16. Define non-planar graph. 17. Define 1-isomorphism and 2-isomorphism.(N/D-16). 18. What are the applications of planar graph? (N/D-16). 19. Define planar Graphs. (A/M-17). 20. Identify two spanning trees for the following graph : (A/M-17) A 1 B 10 C E 9 D 2 3 PART-B
4 1) Every connected graph has atleast one spanning tree.( 8 mark). 2) Show that a path is its own spanning tree.( 8 mark) 3) Show that a Hamilton path is a spanning tree.( 8 mark). 4) A graph is a tree iff it is minimally connected.( 8 mark). 5) Define fundamental cut-sets with an example.( 6 mark). 6) The ring sum of any two cut-sets in a graph is either a third cut-sets or an edge-disjoint union of cut-sets.( 10 mark). 7) A vertex v in a connected graph G is a cut vertex iff there exists two vertices x and y in G such that every path between x and y passes through v.( 8 mark). 8) State and prove Max-flow and Min-cut theorem.( 8 mark). 9. Explain Max-flow and Min-cut theorem. (10) (N/D-16) 10. Explain about fundamental cut-sets and fundamental circuit in a graph. (6) (N/D-16) 11. Prove that every connected graph has atleast one spanning tree. (6) (N/D-16) 12. Prove that the graphs K 5 and K 3,3 are non planar. (10) (N/D-16) 13. Define spanning tree and give an example. (A/M-17) 14. State the Eulers formula relating the number of vertices, edges and faces of a planar connected graph. Give two conditions for testing for planarity of a given graph. Give a sample graph that is planar and another that is non-planar. (16) (A/M-17) UNIT III ( MATRICES COLOURING AND DIRECTED GRAPH ) PART A 1. Define minimal dominating set and maximal independent set. (N/D-16) 2. Find the chromatic number of a complete graph of n vertices. (N/D-16) 3. Does the following graph have a maximal matching? Give reason.(a/m-17) 1 a 2 b 3 c d e 4. Draw K 8 and K 9 and show that thickness of K 8 is 2 while thickness of K 9 is 3.(A/M-17) 5. In a directed graph,when do we say a vertex is isolated. 6. Define Euler digraph.
5 7. What is the upper limit of the chromatic number? 8. Define chromatic number. 9. Define directed graph and undirected graph. 10. Define proper colouring. 11. Find all maximal independent set of the toll graph. a b c d 12. Define maximal independent set. 13. Determine the chromatic number of the following graph. a f b e c 14. Define the term matching and maximal matching of the graph. 15. Explain digraph and give an example. PART-B 1. Derive the chromatic polynomial for the given graph and use that to find information on chromatic number of the graph? 2. Prove that an Euler graph cannot have a cut-set with odd number of edges? 3. Show that if a bi-partite graph has any circuits, they must all be of even lengths? 4. Prove that in any digraph the sum of the in degree of al vertices is equal to the of their out-degree and this sum is equal to the number of edges in the digraph? 5. State and prove five colour theorem? 6. A graph G is 2-chromatic if and only if G is bipartite? 7. State and prove stable marriage theorem? 8. Every tree with two or more vertices in 2-chromatic? 9. A graph with at least one edge in 2-chromatic if it has no circuits of odd length? 10. Prove that Every tree with two or more vertices is 2-chromatic. (5) (N/D-16) 11. Prove that a graph with n vertices is complete graph iff its chromatic polynomial is Pn(λ)= λ (λ -1) (λ -2).( λ -n+1). (6) (N/D-16) 12. Prove that a covering g of a graph is minimal iff g contains no paths of length three or more. (5) (N/D-16) 13. Explain Euler digraph. (10) (N/D-16) 14. Discuss about some types of digraph with suitable example. (6) (N/D-16) 15. If G is a tree with n vertices then show that its chromatic polynomial is p n (λ) = λ(λ 1) n 1. (N/D-16)
6 16. Describe the steps to find adjacency matrix and incidence matrix for a directed graph with a simple example. (16) (A/M-17) 17. Write a note on chromatic polynomials and their applications. (16) (A/M-17) UNIT IV (PERMUTATION AND COMBINATIONS) PART A 1. In how many different ways can the letters of the word LEADING be arranged in such a way that the vowels always come together?(n/d-16) 2. A committee including 3 boys and 4 girls is to be formed from a group of 10 boys and 12 girls. How many different committees can be formed from the group? (N/D-16) 3. State the rule of sum, the first principle of counting.(a/m-17) 4. Use venn diagram to represent the following scenario: If S: a set, C 1 = condition 1 and C 2 - condition 2 satisfied by some elements of S, indicate on the diagram S, N(C 1 ), N( C 2 ) N(C 1, C 2 ) and N(C 1, C 2 ). (A/M-17) 5. Find the co-efficient of x 9 y 3 in the expansion of (x + 2y) Find the number of derangements of 1,2,3,4. 7. Find the number of non-negative integer solutions of the equation x 1 + x 2 + x 3 + x 4 + x 5 = For the positive integer 1,2,3, n there are derangements where 1,2,3,4,5, appear in the first five positions. What is the value of n? 9. Define permutations and give formula permutations. 10. Find r if 6P r = Find the value of p(4,3). 12. Find n if P(n,4) = 42P(n,2) 13. For non-negative integers n and r, if n+1>r, prove that P(n + 1, r) = ( n+1 n+1 r ) P(n,r). 14. Ten students are participating in a race. In how many ways can the first four prizes be won? 15. Find the number of permutations of the letters of the word MASSASAUGA. In how many of these, all four A s are together?.how many of them begin with S? 16. Find how many three letter words can be formed out of the word Triangle. 17. Find the number of arrangements of all the letters in TALLAHASSEE. How many of these arrangements have no adjacent A s? 18. Determine the co-efficient of x 5 y 2 in the expansion of (x + y) Find the coefficient of x 0 in the expansion of (3x 2 2 x ) Determine the coefficient of xyz 2 in (w + x + y + z) Find the coefficient of w 2 x 2 y 2 z 2 in the expansion of (2w x + 3y + z 2) Find the sums of all coefficients in the expansion of (i) (x + y + z) 10 (ii) (2s 3t + 5u + 6v 11w + 3x + 2y) Find the number of positive integer solutions of x 1 + x 2 + x 3 = Find the number of non-negative integer solution of the in equality x 1 + x 2 + x x 6 < Compute ϕ(n) for n= Find ϕ(n) for n equal to How many derangements of 1,2,3,4, Evaluate d 6, d Give the formula for combination.
7 PART-B 1). Determine the number of positive integers n such that 1 n 100 and n is not divisible by 2, 3 or 5. (8) 2). Find the number of non-negative integer solution of the equationx 1 + x 2 + x 3 + x 4 = 18 under the condition x i 7 for i=1, 2, 3, 4. (8) 3).Determine the number of positive integer s n, 1 n 2000, that are (a) not divisible by 2, 3 or 5 (b) not divisible by 2, 3, 5 or 7. (16) 4). Find the rook polynomial for the board shown below (shaded part). (8) ). Fruits A 1, A 2, A 3 and A 4 are to be distributed to four boys B 1, B 2, B 3 and B 4. The boys B 1 and B 2 do not wish to have A 1, the boy B 3 does not want A 2 or A 3 and B 4 refuses A 4. In how many ways the distribution can be made so that no boy is displaced? 8) 6). Find the number of integer solutions of x 1 + x 2 + x 3 + x 4 + x 5 = 30, Where x 1 2, x 2 3, x 3 4, x 4 2, x 5 0. (8) 7). Compute φ(n), Where n= (8) 8). Five professors P 1, P 2, P 3, P 4 and P 5 are to be made class advisor for five sections C 1, C 2, C 3, C 4 and C 5 one professor for each sections. P 1, and P 2 do not wish to become the class advisors for C 1 or C 2, P 3 and P 4 for C 4 or C 5, and P 5 for C 3 or C 4 or C 5. In how many ways can the professors be assigned the work (without displacing any professor)? (8) 9). Four officers P 1, P 2, P 3, P 4 who arrive late for the dinner party find that only one chair at each of five tables T 1, T 2, T 3, T 4 and T 5 is vacant. P 1 will not sit T 1 or T 2, P 2 will not sit at T 2, P 3 will not sit at T 3 or T 4 and P 4 will not sit at T 4 or T 5. Find the number of ways they can occupy the vacant chairs.(8) 10). Using generating function, find the number of partitions of n=6. (8) 11). Find all partitions of n=7. (8) 12)Prove that, for any positive integer n,n!= 13) Determine the co-efficient of (a) w 3 x 2 yz 2 in (2w x + 3y 2z) 8. (b) a 2 b 2 c 2 d 5 in (a + 2b 3c + 2d + 5) 16. n k=0 ( n k )d k.
8 14) In how many ways can the integer 1,2,3.,10 be arranged in a line so that no even integer is in its natural position. 15). Determine the number of integer solutions of x 1+ x 2+ x 3+ x 4 =32, where (a) x i 0, 1 i 4 (b) x i > 0, 1 i 4 (c) x 1, x 2 5, x 3, x 4 7 (d) x i 8, 1 i 4 16).compute ϕ(n) for (i) n = 51, (ii) = ).Find the number of integer solutions of x 1+ x 2+ x 3+ x 4+ x 5 =30 Where x 1 2, x 2 3, x 3 4, x 4 2, x ). (i) How many arrangements are there of all the vowels adjacent in SOCIOLOGICAL? (4) (N/D-16) (ii) Find the value of n for the following: 2P(n,2)+50 = P(2n,2). (5) (N/D-16) (iii) How many distinct four digit intergers can one make from the digits 1,3,3,7,7 and 8? (4) (N/D-16) (iv) In how many possible ways could a student answer a 10-question true-false test? (3) (N/D-16) 19). (i) How many arrangements of the letters in MISSISSIPPI has no consecutive S s? (4) (N/D-16) (ii) A gym coach must select 11 seniors to play on a football team. If he can make his selection in 12,376 ways, how many seniors are eligible to play? (4) (N/D-16) (iii) How many permutations of size 3 can one produce with the letters m, r, a, f and t? (4) (N/D-16) (iv) Rama has two dozen each of n different colored beads. If she can select 20 beads (with repetitions of colors allowed), in 230,230 ways, what is the value of n? (4) (N/D-16) 20) In how many ways can the 26 letters of the alphabet be permuted so that the patterns car,dog, pun or byte occurs? Use the principle of inclusion and exclusion for this. (16) (A/M-17) 21). When n balls numbered 1, 2, 3 n are taken in succession from a container, a rencontre occurs if mth ball withdrawn is numbered m, 1 m n. Find the probability of getting (i) (ii) (iii) (iv) No rencontres. Exactly one rencontre Atleast one rencontre and r rencontries, 1 r n. Show intermediate steps. (16) (A/M-17)
9 Unit-V[Generating Functions] PART-A 1. Find the sequence generated by the following function (3 + x) Using exponential generating function, find the number of ways in which 5 of the letters in the word calculus be arranged. 3. Find the generating function of the sequence 0 2, 1 2, 2 2, 3 2,. 4. Solve the recurrencies a n+1 = 4a n for n 0 gvien that a 0 =3. 5. Find the sequence generated by the following function 1 1 x + 2x3. 6. Find the generating functions of the following sequence 1 2, 2 2, 3 2, 4 2,. 7. Determine the coefficient of x 27 in (x 4 + 2x 5 + 3x 6 + ) Determine the coefficient of x n in (x 8 + x 9 + x 10 + ) Find all partitions of Draw the Ferrers graph for the partition 20= Hence determine the conjugate of this partition. 11.Find the generating function of the following sequence 1,-1,1,-1,1,- 1, 12. Find the generating function of the following sequence 1,2,2 2, 2 3, 2 4,. 13. Find the generating function of the following sequence a, a 3, a 5, a 7,., a R. 14. Determine the sequence generated by the following exponential generating function f(x)=3e 3x. 15. Determine the sequence generated by the following exponential generating function f(x)= 1 1 x. 16. Find the general solution of the following recurrence relation a n+1= 3a n n 0 a 0= Find the general solution of the following recurrence relation a n= 7a n 1 n 1 a 2 = Solve: a n = na n 1 n 1 a 0 = Find : a 12 if a n+1 = 5a n where a n >0 for n 0 given that a 0 = Find the general term of the sequence 2, 10, 50, 250, 21. Find the general term of the sequence 6,-18, 54,-162, 22. Find the partition of Find the partition of Define recurrence relation. NOV/DEC Define generating function. NOV/DEC Give the explanation for the following: APR/MAY 2017
10 Generating function for the no. of ways to have n cents in pennies and nickels.=(1+x+x 2 + )(1+x 5 +x 10 + ) 27. Solve the recurrence relation an+1-an=3n 2 -n n 0 a0=3. APR/MAY 2017 PART-B 1.Solve the recurrence relation a n + a n 1 6a n 2 = 0, n 2, given that a 0 = 1 and a 1 = Solve the recurrence relation a n = 5a n 1 + 6a n 2 = 0, n 2, given that a 0 = 1 and a 1 = Solve the recurrence relation 2a n+2 11a n+1 + 5a n = 0, n 0, given that a 0 = 2 and a 1 = 8. 4.Solve the recurrence relation a n 6a n 1 + 9a n 2 = 0, n 2, given that a 0 = 5 and a 1 = Solve the recurrence relation a n = 2(a n 1 a n 2 ) = 0, n 2, given that a 0 = 1 and a 1 = 2. 6.If a 0 = 0,a 1 = 1, a 2 = 4,a 3 = 37 satisfy the recurrence relation a n+2 + ba n+1 + ca n = 0, where n 0 and b, c are constant,determine b,c and solve for a n. 7. Solve the recurrence relation 2a n+3 = a n+2 + 2a n+1 a n, n 0, given that a 0 = 0, a 1 = 1, a 2 = Solve the recurrence relation a n+2 5a n+1 + 4a 2 n = 0, n 0, given that a 0 = 4,a 1 = Solve the recurrence relation a n 3a n 1 = 5x3 n for n 1, given that a 0 = Using generating function, find the number of partitions of n=6. 11.Find all partitions of n= Solve the recurrence relation a n 3a n 1 = 5(7 n ), n 1, a 0 = Solve the recurrence relation F n+2 = F n+1 + F n = 0, n 0, given that F 0 = 0 and F 1 = Discuss about exponential generating function with an example. (10) (N/D-16) 15. Find the unique solution of the recurrence relation 6a n 7a n 1 = 0, n 1, a 3 = 343. (6) (N/D-16) 16. The population of Mumbai city is 6,000,000 at the end of the year The number of immigrants is20000 n at the end of year n. The population of the city increases at the rate of 5% per year. Use a recurrence relation to determine the population of the city at the end of (8) (N/D-16) 17. Write short notes on summation operator. (8) (N/D-16) 18. If an is count of number of ways a sequence of 1s and 2s will sum to n, for n θ. Eg a3=3 (i) 1, 1, 1; (ii) 1, 2 and (iii) 2, 1 sum up to 3. Find and solve a sequence relation for an. APR/MAY What are Ferrers diagrams? Describe how they are used to (i) represent integer partition (ii) Conjugate diagram or dual partitions (iii) self-conjugates (iv) representing bisections of two partition. APR/MAY 2017
CS6702 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 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 informationVALLIAMMAI ENGINEERING COLLEGE
1 VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 0 20 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK VII SEMESTER CS02- GRAPH THEORY AND APPLICATIONS Regulation 201 Academic Year
More information1 VALLIAMMAI ENGINEERING COLLEGE (A member of SRM Group of Institutions) SRM Nagar, Kattankulathur 603203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year and Semester : IV/ VIII Section : CSE 1 & 2
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 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 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 informationNANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH 1301 DISCRETE MATHEMATICS TIME ALLOWED: 2 HOURS
NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION 2015-2016 MH 1301 DISCRETE MATHEMATICS May 2016 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains FIVE (5) questions
More information1. Consider the 62-element set X consisting of the twenty-six letters (case sensitive) of the English
MATH 3012 Final Exam, May 3, 2013, WTT Student Name and ID Number 1. Consider the 62-element set X consisting of the twenty-six letters (case sensitive) of the English alphabet and the ten digits {0, 1,
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 informationMath Summer 2012
Math 481 - Summer 2012 Final Exam You have one hour and fifty minutes to complete this exam. You are not allowed to use any electronic device. Be sure to give reasonable justification to all your answers.
More informationGraph Theory: Introduction
Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Resources Copies of slides available at: http://www.facweb.iitkgp.ernet.in/~pallab
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 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 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 information2. There are 7 people to be seated at a round table. How many seating arrangements are possible? How many times must they change places so that
Example 1.1 1. Two students witness burglar Bill making off from a crime scene in his getaway car. The first student tells the police that the number plate began with and R or a P and that the first numerical
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 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 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 informationDiscrete Structures. Fall Homework3
Discrete Structures Fall 2015 Homework3 Chapter 5 1. Section 5.1 page 329 Problems: 3,5,7,9,11,15 3. Let P(n) be the statement that 1 2 + 2 2 + +n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. a)
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 informationGRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)
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 informationPacket #6: Counting & Graph Theory. Applied Discrete Mathematics
Packet #6: Counting & Graph Theory Applied Discrete Mathematics Table of Contents Counting Pages 1-8 Graph Theory Pages 9-16 Exam Study Sheet Page 17 Counting Information I. Product Rule: A B C = A * B
More informationCombinatorics MAP363 Sheet 1. Mark: /10. Name. Number. Hand in by 19th February. date marked: / /2007
Turn over Combinatorics MAP6 Sheet Hand in by 9th February Name Number Year Mark: /0 date marked: / /200 Please attach your working, with this sheet at the front. Guidance on notation: graphs may have
More informationMT365 Examination 2007 Part 1. Q1 (a) (b) (c) A
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
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 informationExplain nearest neighbour method to obtain a Hamiltonian circuit in a g raph. ( Dec E xplain traveling salesperson problem. D efine * i ) Connected gr
I ntroduction Q uestion Paper Unit 1 1 ) Define with an example : (i) Graph (ii) multigraph (iii) pseudograph (iv) simple graph (v) digraph (vi) regular graph (vii) complete graph (viii) b ipartite Graph
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 informationChapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:
Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have
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 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 informationDiscrete Math: Selected Homework Problems
Discrete Math: Selected Homework Problems 2006 2.1 Prove: if d is a common divisor of a and b and d is also a linear combination of a and b then d is a greatest common divisor of a and b. (5 3.1 Prove:
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
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 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 informationComputational Discrete Mathematics
Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica SRIRAM PEMMARAJU The University of Iowa STEVEN SKIENA SUNY at Stony Brook CAMBRIDGE UNIVERSITY PRESS Table of Contents
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 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 informationFINAL EXAM SOLUTIONS. 1. Consider the 9-element set X consisting of the five letters {a, b, c, d, e} and the four digits
FINAL EXAM SOLUTIONS Student Name and ID Number MATH 0 Final Exam, December 5, 00, WTT Note. The answers given here are more complete and detailed than students are expected to provide when taking a test.
More informationCLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION
CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the
More informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationMath.3336: Discrete Mathematics. Chapter 10 Graph Theory
Math.3336: Discrete Mathematics Chapter 10 Graph Theory Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
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 informationChapter 1 Graph Theory
Chapter Graph Theory - Representations of Graphs Graph, G=(V,E): It consists of the set V of vertices and the set E of edges. If each edge has its direction, the graph is called the directed graph (digraph).
More informationSTUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl
Page 1 of 13 NAME: STUDENT NUMBER: MATH 1281 - Final Exam Lakehead University April 13, 2011 Dr. Adam Van Tuyl Instructions: Answer all questions in the space provided. If you need more room, answer on
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 informationGraph Theory CS/Math231 Discrete Mathematics Spring2015
1 Graphs Definition 1 A directed graph (or digraph) G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices
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 informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 7 Graph properties By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-2: Eulerian
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 informationNotation Index. Probability notation. (there exists) (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5.
Notation Index (there exists) (for all) Fn-4 Fn-4 (such that) Fn-4 B n (Bell numbers) CL-27 s t (equivalence relation) GT-5 ( n ) k (binomial coefficient) CL-15 ( n m 1,m 2,...) (multinomial coefficient)
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 informationNetwork Topology and Graph
Network Topology Network Topology and Graph EEE442 Computer Method in Power System Analysis Any lumped network obeys 3 basic laws KVL KCL linear algebraic constraints Ohm s law Anawach Sangswang Dept.
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 informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
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 informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationIntroduction to Graphs
Graphs Introduction to Graphs Graph Terminology Directed Graphs Special Graphs Graph Coloring Representing Graphs Connected Graphs Connected Component Reading (Epp s textbook) 10.1-10.3 1 Introduction
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 16 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 16 Notes Goals for this week Graph basics Types
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 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 informationNotation Index 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coef
Notation 9 (there exists) Fn-4 8 (for all) Fn-4 3 (such that) Fn-4 B n (Bell numbers) CL-25 s ο t (equivalence relation) GT-4 n k (binomial coefficient) CL-14 (multinomial coefficient) CL-18 n m 1 ;m 2
More informationDiscrete Mathematics Exam File Fall Exam #1
Discrete Mathematics Exam File Fall 2015 Exam #1 1.) Which of the following quantified predicate statements are true? Justify your answers. a.) n Z, k Z, n + k = 0 b.) n Z, k Z, n + k = 0 2.) Prove that
More informationGraph theory - solutions to problem set 1
Graph theory - solutions to problem set 1 1. (a) Is C n a subgraph of K n? Exercises (b) For what values of n and m is K n,n a subgraph of K m? (c) For what n is C n a subgraph of K n,n? (a) Yes! (you
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 informationASSIGNMENT 4 SOLUTIONS
MATH 71 ASSIGNMENT SOLUTIONS 1. If F : X X is a function, define f (x) to be (f f)(x), and inductively define f k (x) (f f k 1 )(x) for each integer k. (So f (x) (f f )(x) f(f(f(x))) for instance.) We
More informationDiscrete Mathematics (2009 Spring) Graphs (Chapter 9, 5 hours)
Discrete Mathematics (2009 Spring) Graphs (Chapter 9, 5 hours) Chih-Wei Yi Dept. of Computer Science National Chiao Tung University June 1, 2009 9.1 Graphs and Graph Models What are Graphs? General meaning
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 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 informationAn Introduction to Graph Theory
An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and
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 informationCourse Code : MCS-033 Course Title : Advanced Discrete Mathematics Assignment Number : MCA(III)/033/Assignment/2018-19 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15th October, 2018
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 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 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 informationCS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs
CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge
More informationMath 778S Spectral Graph Theory Handout #2: Basic graph theory
Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible
More informationSolutions to Exercises 9
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 9 (1) There are 5 cities. The cost of building a road directly between i and j is the entry a i,j in the matrix below. An indefinite entry indicates
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 informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.
More informationOrdinary Differential Equation (ODE)
Ordinary Differential Equation (ODE) INTRODUCTION: Ordinary Differential Equations play an important role in different branches of science and technology In the practical field of application problems
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 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 informationChapter 2 Graphs. 2.1 Definition of Graphs
Chapter 2 Graphs Abstract Graphs are discrete structures that consist of vertices and edges connecting some of these vertices. Graphs have many applications in Mathematics, Computer Science, Engineering,
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 informationWorksheet for the Final Exam - Part I. Graphs
Worksheet for the Final Exam - Part I. Graphs Date and Time: May 10 2012 Thursday 11:50AM~1:50PM Location: Eng 120 Start with the Self-Test Exercises (pp.816) in Prichard. 1. Give the adjacency matrix
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 informationGraphs. Pseudograph: multiple edges and loops allowed
Graphs G = (V, E) V - set of vertices, E - set of edges Undirected graphs Simple graph: V - nonempty set of vertices, E - set of unordered pairs of distinct vertices (no multiple edges or loops) Multigraph:
More informationMath 4410 Fall 2010 Exam 3. Show your work. A correct answer without any scratch work or justification may not receive much credit.
Math 4410 Fall 2010 Exam 3 Name: Directions: Complete all six questions. Show your work. A correct answer without any scratch work or justification may not receive much credit. You may not use any notes,
More informationReference Sheet for CO142.2 Discrete Mathematics II
Reference Sheet for CO14. Discrete Mathematics II Spring 017 1 Graphs Defintions 1. Graph: set of N nodes and A arcs such that each a A is associated with an unordered pair of nodes.. Simple graph: no
More informationDefinition 1.1. A matching M in a graph G is called maximal if there is no matching M in G so that M M.
1 Matchings Before, we defined a matching as a set of edges no two of which share an end in common. Suppose that we have a set of jobs and people and we want to match as many jobs to people as we can.
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
More information(5.2) 151 Math Exercises. Graph Terminology and Special Types of Graphs. Malek Zein AL-Abidin
King Saud University College of Science Department of Mathematics 151 Math Exercises (5.2) Graph Terminology and Special Types of Graphs Malek Zein AL-Abidin ه Basic Terminology First, we give some terminology
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 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 informationCHAPTER 5. b-colouring of Line Graph and Line Graph of Central Graph
CHAPTER 5 b-colouring of Line Graph and Line Graph of Central Graph In this Chapter, the b-chromatic number of L(K 1,n ), L(C n ), L(P n ), L(K m,n ), L(K 1,n,n ), L(F 2,k ), L(B n,n ), L(P m ӨS n ), L[C(K
More informationIntroduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow
Introduction to Engineering Systems, ESD.00 Lecture 7 Networks Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow The Bridges of Königsberg The town of Konigsberg in 18 th century
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More information