Graphs and Networks SF

How many of these vertices have an even degree?

• 1

• 2

• 3

• 4

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

• 3

• 4

• 5

• 9

Four friends are planning a dinner party and nominate which course of the meal they would be happy

to bring, as shown in the bipartite graph below.

• Anna – entrée,

  Bri – soup,

  Chris – main, Dhevan - dessert

• Anna – entrée,

  Bri – main,

  Chris – soup, Dhevan - dessert

• Anna – soup,

  Bri – main,

  Chris – entree, Dhevan - dessert

• Anna – entrée,

  Bri – main,

  Chris – dessert, Dhevan - soup

The adjacency matrix for the graph shown is

• 
• 
• 
• 

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

• 
• 
• 
• 

For the activity network, which statement is NOT true?

• Activity A must be completed before any other activity can begin.

• Activities B and C have to begin at the same time.

• Activities E and G could be done at the same time

• All other activities must be completed before Activity I can begin.

Which of the following statements is NOT true?

In critical path analysis, ‘critical path’ is the term given specifically to those activities

• which have zero float time

• which must be completed for the project to be finished

• whose latest starting time and earliest starting time are the same

• which will delay the finish of the project if they are not completed on time

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

• 
• 
• 
• 

The minimum spanning tree for the network below will have

• 4 edges

• 5 edges

• 6 edges

• 7 edges

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

• closed walk

• Eulerian trail

• Hamiltonian cycle

• closed path