Exercise 13B - Adjacency matrices

A matrix that records the number of connections between vertices is called an

• Adversity matrix

• Answer matrix

• Adjacency matrix

• Awesome matrix

In an Adjacency matrix loops are counted as ___ edge.

• one

• two

• three

• four

How many faces does this graph have

• 1

• 2

• 3

• 4

Choose which network matches the adjacency matrix

• 
• 
• 
• 

Which vertex has a loop?

• A

• B

• C

• D

How many degrees does vertex B have?

• 2

• 3

• 4

• 6

The number of faces in the graph is?

• 1

• 2

• 3

• 4

Which vertices have loops?

• B and D

• A and B

• A and C

• C and D

In column and row C are all zeros. What can you tell about vertex C?

• Vertex A connects with only two other vertices

• Vertex C is not connected to any other vertices.

• Vertex B does not connect to Vertex A

• Vertex C is connected to all the other vertices

The degree for vertex B is

• 5

• 3

• 4

• 2