Name: _________________________ Course and Set: _________________

Graph Theory
Vocabulary

a. Vertex – point
b. Edges – line connecting two points
c. Degree – number of edges intersecting an edge
d. Path – two or more edges
e. Circuit – path that able to go back at the starting point
f. Connected – graphs that are linked
g. Weights – lengths associated with the edge

Here is a village site development plan. The development plan’s inspector walk down every street in the
development making sure that homeowners, landscaping conforms to the community requirement.

We can simplify it using graphs. We can use vertices to represent all the street intersection. The idea here is to simplify
complicated images from the actual picture.
In 18th Century, there is a game played by the people who lived at old Prussian City of Konigsberg. People there was
puzzled on how visit all places in the city and how to get back to their original position without crossing the same bridge
twice.

Leonhard Euler, (born April 15, 1707, Basel, Switzerland—died September 18,

1783, St. Petersburg, Russia), Swiss mathematician and physicist, one of the
founders of pure mathematics. He not only made decisive and formative
contributions to the subjects of geometry, calculus, mechanics, and number
theory but also developed methods for solving problems in
observational astronomy and demonstrated useful applications of mathematics in
technology and public affairs.

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once
(allowing for revisiting vertices). Similarly, Eulerian circuit or Eulerian cycle is Eulerian trail that starts and ends on the
same vertex.

Let’s Play!

Can you find the right path in this graph that can explore or walk all the edges without the repetition of the same edge?
See if you can.

1. 2.
 3.

Path or Circuit?

Going Back to the Problem of the bridges.

This bridge puzzle of the people was solved using Euler’s Theorem. If another bridge will be constructed,
then it will be possible.
Activity! Construct 1 graph for each Euler’s Graph Theorem