-an algorithmic argument

 

Objective::

Students will illustrate an algorithmic argument for the Euler circuit Theorem.

Materials :

• 3D model of a regular tetrahedron
• overhead of planar graph for a regular tetrahedron

Optional:

Java, director or powerpoint script can be used to illustrate the algorithm through a computer animation

Lesson:

Demonstrate the algorithm for a closed chain, and an Eulerian closed chain using a tetrahedron model. Discuss the algorithmic argument as an alternative method of proof.

Assignment:

Create three planar graphs then apply the Eulerian closed chain algorithm to each of the graphs to determine validity. {use one of each of the following}

• A graph that is an Euler circuit
• A graph that is an Euler path
• A graph that is neither

Algorithms

Closed Chain Algorithm

Eulerian Closed Chain Algorithm