Discrete Math
Review Chapter 7
Solve the Problem.
1) Identify which graph(s) show a tree below:
2) The number of edges in a tree with 49 vertices is
3) The number of vertices in a tree with 49 edges is
4) Suppose T is a tree with 41 vertices. Then T has
bridge(s).
5) Suppose G is a graph with 51 vertices and 50 edges. It is a
6) How many spanning trees in each of the following graphs:
Use Kruskal’s Algorithm and the following graph for questions #7 – 11.
7) Which edge should we choose first?
8) Which edge should we choose second?
9) Which edge should we choose third?
10) How many edges total should we choose?
11) The total weight of the minimum spanning tree is
IFF it is connected.
Use Kruskal’s Algorithm to find the MST for the following graph (questions #12 – 16.)
12) Which edge should we choose first?
13) Which edge should we choose second?
14) Which edge should we choose third?
15) How many edges total should we choose?
16) The total weight of the minimum spanning tree is
Use Kruskal’s Algorithm to find the MST for the following graph (questions #17 – 19.)
17) Which edge is chosen third?
18) Which edge is chosen last?
19) The length of the minimum spanning tree connecting the 6 cities is
Solve the problem.
20) The length of the shortest network connecting points A, B, and C below is
21) The length of the shortest network connecting points A, B, and C below is
Also, Be sure to …
Know the Summary of Tree Properties
Read all of Section 7.4 and 7.5