Networks 1 DFA

A planar graph has 7 vertices and 11 edges. The number of faces that the graph has is

• 2

• 3

• 4

• 5

• 6

Using the graph on the right, a walk that is also a hamiltonian path is

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

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

• A – E – B – C – D

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

• A – E – B – C

The graph on the right would have an eulerian trail if an edge was added between vertices

• A and D

• B and F

• B and D

• E and B

• E and F

A planar graph has 6 faces and 14 edges. The number of vertices that the graph has is

• 6

• 10

• 14

• 18

• 22

The adjacency matrix shown on the right could represent the connections between the vertices of which one of the following graphs?

• 
• 
• 
• 
• 

Using the graph on the right, a walk that is also an eulerian trail is

• A – D – C – B

• A – D – A – B – C

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

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

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

The sum of vertex degrees in this graph is:

• 10

• 12

• 14

• 16

• 18

A woman drives along some of the roads to visit some of the towns along the following route: E – A – B – C – D – E. The walk she follows is best described as a

• walk only

• trail

• path

• circuit

• cycle

The degree of the vertex A is:

• 1

• 2

• 3

• 4

• 5

The number of vertices in the given graph is:

• 3

• 5

• 6

• 7

• 4