Introduction to Networks Quiz

In the graph shown, there are _ vertices.

(a)  

In the graph shown, there are _ edges.

(a)  

The degree of vertex D is:

Mathematical Equivalence

ON

The sum of degrees in the graph shown is:

Mathematical Equivalence

OFF

The sum of degrees in the graph shown is:

Mathematical Equivalence

ON

How many odd vertices are in the graph shown?

(a)  

Consider the graph. Without visiting a vertex more than once, or using an edge more than once, there are ___ walks connecting vertex A with vertex D.

• 1

• 2

• 3

• 4

Consider the graph. Without visiting a vertex more than once, or using an edge more than once, there are _ walks connecting vertex A with vertex D.

Mathematical Equivalence

ON

Consider the graph. Without visiting a vertex more than once, or using an edge more than once, there are _ walks connecting vertex A with vertex E.

Mathematical Equivalence

ON

Consider the graph. Without visiting a vertex more than once, or using an edge more than once, there are _ walks connecting vertex A with vertex B.

Mathematical Equivalence

ON