12 General Master Class 3 Graphs and Networks

If a planar graph has two faces and five edges, how many vertices will it have?

• 3

• 4

• 5

• 9

The adjacency matrix for the graph shown is:

• 
• 
• 
• 

Identify which one of the following graphs is NOT a tree.

• 
• 
• 
• 

Identify the graph which is NOT a Eulerian graph

• 
• 
• 
• 

The walk C-D-E-H-F-G-A-B-C is most completely described as

• closed walk

• Eulerian trail

• Hamiltonian cycle

• closed path

Which directed network below is represented by the given adjacency matrix?

• 
• 
• 
• 

To identify the minimum spanning tree for the network below, you could use

• a minimum cut

• Prim's algorithm

• critical path analysis

• the Hungarian algorithm