Complete 12 questions below by choosing at least four from each
section.
• Ch. 11 of Discrete and Combinatorial Mathematics
o Exercise 11.1, problems 3, 6, 8, 11, 15, & 16
• Ch. 11 of Discrete and Combinatorial Mathematics
o Exercise 11.2, problems 1, 6, 12, & 13,
o Exercise 11.3, problems 5, 20, 21, & 22
o Exercise 11.4, problems 14, 17, & 24
o Exercise 11.5, problems 4 & 7
o Exercise 11.6, problems 9 &10
• Ch. 12 of Discrete and Combinatorial Mathematics
o Exercise 12.1, problems 2, 6, 7, & 11
o Exercise 12.2, problems 6 & 9
o Exercise 12.3, problems 2 & 3
o Exercise 12.5, problems 3 & 8
Ch. 11 of Discrete and Combinatorial Mathematics
Exercise 11.1, problems 3, 6, 8, 11, 15, & 16
3. For the graph in Fig. 11.7, how many paths are there from b to f ?
…………………………………………………………….
Ch. 11 of Discrete and Combinatorial Mathematics
Exercise 11.2, problems 6, 13,
Exercise 11.3, problems 20, 21
20). a) Find an Euler circuit for the graph in Fig. 11.44.
Exercise 11.4, problems 17
Exercise 11.5, problems 7
Ch. 12 of Discrete and Combinatorial Mathematics
Exercise 12.1, problems 2, 7, & 11
Exercise 12.5, problems 3
3). Let T = (V, E) be a tree with |V | = n ≥ 3.
