Assignment 2

Department of Computer Science and Engineering

CSE 236: Math for Computer Science

1. Consider the following graphs and determine whether the given graph has an Euler
circuit. Construct such a circuit when one exists. If no Euler circuit exists, determine
whether the graph has an Euler path and construct such a path if one exists.

a. b.
c.

2. Consider the following graphs and determine whether the given graph has an Euler
circuit. Construct such a circuit when one exists. If no Euler circuit exists, determine
whether the graph has an Euler path and construct such a path if one exists.

a. b. c.

3. Show that the following graph shown here does not have a Hamilton circuit, but that
the sub graph obtained by deleting a vertex v, and all edges incident with v, does have
a Hamilton circuit.
4. Find out the shortest path and length of a shortest path between a and z in the given
weighted graph using Dijkstra’s algorithm.

5. Consider the following graph and find a shortest route between Newark and
Camden using these roads.