Graph & Networks review - Cambridge 8A - 8F

The number of vertices in the graph is

• 3

• 5

• 6

• 7

• 9

The number of edges in the graph is

• 3

• 5

• 6

• 7

• 9

Answer explanation

Edges are lines

The degree of vertex B in the graph is

• 1

• 2

• 3

• 4

• 5

Answer explanation

Degree is the number of connections. Loops count as 2.

The number of even vertices in the graph is

• 1

• 2

• 3

• 4

• 5

Answer explanation

If the degree is an even number, the vertex is "even".

For which graph below is the sum of the degrees of the vertices equal to 14?

• 
• 
• 
• 
• 

Answer explanation

Count the edges and double it

The graph that matches the matrix is

• 
• 
• 
• 
• 

Answer explanation

The adjacency matrix that matches the graph

shown is

• 
• 
• 
• 
• 

Answer explanation

A and B have only one connection to C each.

D has a loop that is 1 edge that connects to itself.

I don't know why D and E are the same matrix.

The sequence of vertices C-B-E-A-E-G represents

• a walk only

• a trail

• a path

• a circuit

• a cycle

Answer explanation

C-B-E-A-E-G

A walk can repeat edges.

The sequence of vertices D-E-H-G-E-A-B-C-D represents

• a walk only

• a trail but not a circuit

• a path but not a cycle

• a circuit

• a cycle

Answer explanation

D-E-H-G-E-A-B-C-D

A walk that starts and stops at the same place is closed.

Trails don't repeat edges but can repeat vertices.

A closed trail is a circuit.

The sequence of vertices C-B-E-A-F-E-G-H represents

• a walk only

• a trail but not a circuit

• a path but not a cycle

• a circuit

• a cycle

Answer explanation

C-B-E-A-F-E-G-H

A walk that starts and stops at the same place is closed.

Trails don't repeat edges but can repeat vertices.

A closed trail is a circuit.