Questions on Basic Discrete Mathematics - Homework 13 | MATH 213, Assignments of Discrete Mathematics

Material Type: Assignment; Class: Basic Discrete Mathematics; Subject: Mathematics; University: University of Illinois - Urbana-Champaign; Term: Fall 2007;

Typology: Assignments

Pre 2010

Uploaded on 03/11/2009

koofers-user-1yr
koofers-user-1yr 🇺🇸

9 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 213 - Homework 13
Assigned: 11/14/07
Due: 11/28/07 at the start of class.
Notation: Exercise a.b.c(d) stands for part (d) of Exercise c from Section a.b.
Problems:
(1) 9.4.6.
(2) 9.4.14(c).
(3) 9.4.28.
(4) 9.5.4.
(5) 9.5.10.
(6) Show that if Gis a connected graph where every vertex has even degree, then no edge
is a cut edge.
(7) Show that a bipartite graph with an odd number of vertices cannot have a Hamilton
circuit.
(8) 9.6.6(d)
(9) 9.6.8(c)
(10) 9.6.8(d)
1

Partial preview of the text

Download Questions on Basic Discrete Mathematics - Homework 13 | MATH 213 and more Assignments Discrete Mathematics in PDF only on Docsity!

Math 213 - Homework 13

Assigned: 11/14/

Due: 11/28/07 at the start of class.

Notation: Exercise a.b.c(d) stands for part (d) of Exercise c from Section a.b.

Problems:

(1) 9.4.6. (2) 9.4.14(c). (3) 9.4.28. (4) 9.5.4. (5) 9.5.10. (6) Show that if G is a connected graph where every vertex has even degree, then no edge is a cut edge. (7) Show that a bipartite graph with an odd number of vertices cannot have a Hamilton circuit. (8) 9.6.6(d) (9) 9.6.8(c) (10) 9.6.8(d)

1