Review of Network Concepts

Which of the following vertices has the highest degree?

• Vertex B

• Vertex C

• Vertex D

• Vertex E

How many edges are in the network diagram?

• 4

• 5

• 6

• 7

Which of the following is a valid path?

• A–E–B–C

• C–D–A–E–B–A

• C–D–A–E–B–C

• A–E–B

Answer explanation

Remember a path can't visit the same axis more than once and you have to follow the directions!

Which one of the following makes a path?

• A–E–D–B–C

• E–D–A–B–C–E

• A–E–D–C–B–D–A–E

• E–D–C–B–D–C–A

Answer explanation

In a path, each vertex only appears once (with the exception of the start and finish). A walk can repeat vertices.

What is the length of the shortest path from A to C in the network?

• 17

• 18

• 19

• 20

What is the length of the minimum spanning tree?

• 30

• 31

• 33

• 34

What is the length of the minimum spanning tree?

• 18

• 19

• 20

• 21

Which of the following vertices have an odd degree?

• Q and S

• Q and R

• S and R

• S and T

What is the degree of the vertex E?

• 1

• 2

• 3

• 4

Identify the true statement.

• Deg(A) = Deg(B)

• Deg(B) = Deg(C)

• Deg(c) = Deg(D)

• Deg(D) = Deg(E)