MATH 115

Spring 2019 Homework 4 due Thursday 5/9

4.1, 4.2, 4.9, 4.14, 4.15, 4.28, 4.29, 4.39.

1.
(4.1) Give an example of a nontrivial connected graph G with the properties that
(1) every bridge of G is adjacent to an edge that is not a bridge,
(2) every edge of G that is not a bridge is adjacent to a bridge,
(3) G contains two nonadjacent bridges and
(4) every two edges of G that are not bridges are adjacent.

Solution.

1
MATH 115
Spring 2019 Homework 4 due Thursday 5/9

2.
(4.2) Prove that every connected graph all of whose vertices have even degrees contains no
bridges.

Solution.

2
MATH 115
Spring 2019 Homework 4 due Thursday 5/9

3.
(4.9) Show that a graph of order n and size n − 1 need not be a tree.

Solution.

3
MATH 115
Spring 2019 Homework 4 due Thursday 5/9

4.
(4.14) A certain tree T of order 35 is known to have 25 vertices of degree 1, two vertices of
degree 2, three vertices of degree 4, one vertex of degree 5 and two vertices of degree 6. It
also contains two vertices of the same (unknown) degree x. What is x?

Solution.

4
MATH 115
Spring 2019 Homework 4 due Thursday 5/9

5.
(4.15) A tree T with 50 end-vertices has an equal number of vertices of degree 2, 3, 4 and 5
and no vertices of degree greater than 5. What is the order of T ?

Solution.

5
MATH 115
Spring 2019 Homework 4 due Thursday 5/9

6.
(4.28) Apply both Kruskal’s and Prim’s Algorithms to find a minimum spanning tree in the
weighted graph given below. In each case, show how this tree is constructed.

Solution.

6
MATH 115
Spring 2019 Homework 4 due Thursday 5/9

7.
(4.29) Let G be a connected weighted graph whose edges have distinct weights. Prove that
G has a unique minimum spanning tree.

Solution.

7
MATH 115
Spring 2019 Homework 4 due Thursday 5/9

8.
(4.39)
(a) Use the Matrix Tree Theorem to determine the number of spanning trees of the graph
given below.
(b) Draw all spanning trees in the graph G.

Solution.