Chapter 2 Network concepts review quiz

1. A network diagram is shown below. 8. Find the length of the minimum spanning tree.

a. Find the vertices with an even degree.

b. Find the vertices with an odd degree.
c. Find the number of edges. 9. Find the minimum spanning tree for the
d. What is the degree of vertex A? weighted graph below.
2. Identify the walk in each of the graphs below as
a trail, path, circuit or cycle.

3. Identify the following sequence of vertices as 10. A weighted graph is shown below.
either a trail or cycle.
a. F–G–C–H–E–D–F
b. F–E–H–C–I–H–J–G
4. Are the following graphs connected?

a. Find the shortest distance from A to C

b. Find the shortest distance from G to C.
11. A weighted graph is shown below.
Graph 1 Graph 2
5. For each of the following graphs determine
whether the graph has an Eulerian trail, an
Eulerian circuit or neither.

a. Find the shortest distance from A to C.

b. Find the shortest distance from E to C.
Graph 1 Graph 2 c. Find the shortest distance from F to B.
6. Identify a Hamiltonian cycle for the network d. Find the shortest distance from F to C.
graph below starting at A. 12. What is the length of the shortest path from A
to F?

7. Find the minimum spanning tree for the graph

below.

© G K Powers 2018 Published by Cambridge University Press 1