Name: ______________________________________________________ Course:______________________

Assessment Task

Direction: Answer each item.

1. For each graph, determine the number of edges, the number of

vertices, the number of vertices that are of odd degree, whether the
graph is connected, and whether the graph is complete.

Number Is the graph

Number of
Number
Graph of vertices
of edges connected? complete?
vertices of odd
degree

2. Determine whether the two graphs are equivalent.

3. Label the second graph so that it is equivalent to the first graph.

4. Consider the graphs given in the following table.

Determine whether the graph is Eulerian. If it is, find an Euler circuit.

If it is not, explain why.

If yes, sketch If no, explain

Is the graph
Graph the Euler why.
Eulerian?
circuit

c
 If the graph does not have an Euler circuit, does it have an Euler path?
If so, find one. If not, explain why.

Does the graph If no, explain

If yes, sketch
Graph contain an why.
the Euler path
Euler path?

5. Use Dirac’s algorithm to verify that the following graphs are

Hamiltonian. Then find the Hamiltonian circuit.

Graph Verification Hamiltonian circuit

6. Consider the given graph below. Find two Hamiltonian circuits with
different total weights, starting at vertex A. Compute the total weight
of each circuit.

Graph Hamiltonian circuit 1 Hamiltonian circuit 2

Total weight: Total weight:

7. Consider the graph below. Use the greedy algorithm to find a

Hamiltonian circuit starting at vertex B.

Graph Hamiltonian circuit

8. Show that each of the given graphs is planar by finding a planar

drawing.

Graph Planar drawing

9. Verify Euler’s formula for each graph given.

Graph Verification

�=
�=
�=

�=
�=
�=

10. Represent the given map by a graph and find a coloring of the graph
using the least possible number of colors. Then color the map based on
the graph coloring you found.

Graph and Graph

Uncolored map Coloring of the map
coloring