Test Total Name Final Combinatorics and Graph Theory 3450:415/515 Dr. Norfolk May 11, 2005 1. Consider the graph G with vertex set V = cfw_a, b, c, d, e and edge set E = cfw_a, b, cfw_a, c, cfw_a, d, cfw_a, e, cfw_b, c, cfw_b, d, cfw_c, d, cfw_c, e, cfw_d
Test Total Name Final Examination Dr. Norfolk Instructions : 1. Please include any references that you use. 2. Graduate students should do all problems, undergraduates should attempt 8 of the 10. Problems 1. An Euler circuit of a graph G is a circuit whic
Test Total Name Final Combinatorics and Graph Theory 3450:415/515 Dr. Norfolk May 7, 2007 Show all work. Graduate students should do all 10 problems, undergraduate students will be graded on 9 of the 10 1. A connected graph G has n vertices and n edges. P
Test Total Name
Midterm Combinatorics and Graph Theory 3450:415/515 Dr. Norfolk March XX, 2005 1. A certain computer system requires a password of between 7 and 10 characters. Each character can be a letter (upper and lower-case are equivalent), or a digi
Test Total Name Final Examination Dr. Norfolk Combinatorics and Graph Theory 3450:415/515:001 Dec 16, 1998
1. Given a graph G = (V, E), an Euler circuit of G is a circuit which visits each vertex, and uses every edge exactly once. For each of the followin
Test Total Name Final Examination Dr. Norfolk Combinatorics and Graph Theory 3450:415/515:001 Friday, July 19, 2002
Instructions : Do 8 of the 10 problems Problems 1. Suppose that we wish to sample from a total of 20 boxes, each of which contains some num
Test Total Name Midterm Combinatorics and Graph Theory 3450:415/515 Dr. Norfolk March 28, 2007 1. The University of Akron has assembled 18 (numbered) crates of supplies for hurricane relief. There are 20 (numbered) trucks leaving the Akron area. (a) How m
Test Total Name Midterm Combinatorics and Graph Theory 3450:415/515 Dr. Norfolk March 23, 2005 1. The Department of Obscure Studies is moving its oces in April. Each of the 24 people in the Department will be assigned a number in the range 1, 2, , 30, rep