MATH 239 ASSIGNMENT 6

Due Friday, November 14, at NOON

in drop boxes (at St. Jeromes for Sec 01,
outside MC 4067 for Sec 02, 03, 04)

1. For each of the following graphs:

h a g f

g h
b e
i H: i
G:
f c a d

e d b c

(a) Find the breadth first search tree, rooted at a, in which the vertices are added in alpha-
betical order whenever there is a choice.

(b) Prove or disprove that the graph is planar.

2. (a) Let G be a connected graph. Suppose that the algorithm for growing a breadth first
search tree produces the exactly the same spanning tree no matter which vertex is chosen as
the root. Prove that G is a tree.

(b) Let G be a connected graph with at least 3 vertices. The depth of a breadth first search
tree is defined to be maximum of the levels of the vertices in the tree. Let d be a positive
integer. Suppose that the algorithm for growing a breadth first search tree produces a tree
of depth d, no matter which vertex is chosen as the root. Prove that G does not contain a
bridge.

3. A planar graph G has girth 5 and every vertex of G has degree at least 3. Prove that G has
at least 20 vertices.

4. (a) Let H a graph obtained by deleting k edges in the 5-cube. If H is planar, prove that k
must be greater than or equal to 20.

(b) Let P be a planar embedding of a planar graph obtained by deleting exactly 20 edges in
the 5-cube. Determine all possibilities for the number of the faces, the number of components,
and the degrees of the faces of P .

(c) Does a planar embedding P as described in part (b) exist? Justify your answer.

5. Let G be a planar graph in which the degree of every vertex is one of 4, 8, 12, 16, 20, . . . . Prove
that G has more vertices of degree 4 than it has vertices of any other degree.