1. Graphs, Paths & Circuits
4-1 Graph Theory
Graphs, Paths & Circuits

2. WHAT YOU WILL LEARN • Graphs, paths and circuits
• The Königsberg bridge problem

3. History
This was developed by Leonhard Euler (pronounced “oiler”) to study the Konigsberg Bridge problem.
Konigsberg was situated on both banks of the Prigel River in Eastern Prussia with a series of seven bridges connecting the banks via two islands.
The people of Konigsberg wanted to know if it was possible to cross all seven of the bridges without crossing any twice.

4. Definitions
A graph is a finite set of points called vertices (singular form is vertex) connected by line segments (not necessarily straight) called edges.
A loop is an edge that connects a vertex to itself. A B C D
Loop
Edge
Vertex
Not a vertex

5. Example: Map
The map shows the states that make up part of the Midwest states from Weather Underground, Inc. Construct a graph to show the states that share a common border.
Michigan
Ohio
Indiana
Kentucky
West Virginia

6. Solution Each vertex will represent one of the states.
If two states share a common border, connect the respective vertices with an edge.

7. Solution (continued) MI OH IN KY WV Michigan Ohio Indiana
Kentucky
West Virginia

8. Definitions
The degree of a vertex is the number of edges that connect to that vertex.
A vertex with an even number of edges connected to it is an even vertex.
A vertex with an odd number of edges connected to it is an odd vertex.
MI, OH, and WV are even vertices
IN, KY are odd vertices MI OH IN KY WV

9. Definitions
A path is a sequence of adjacent vertices and edges connecting them.
C, D, A, B is an example of a path.
A circuit is a path that begins and ends at the same vertex.
A, C, B, D, A forms a circuit. A B C D E A B C D E

10. Definitions
A graph is connected if, for any two vertices in the graph, there is a path that connects them.
Examples of disconnected graphs. G H J K A B C D

11. Definitions (continued)
A bridge is an edge that if removed from a connected graph would create a disconnected graph. A B C D
bridge G H J K
bridge

12. Select the graph with six vertices, a bridge, and a loop.

13. Select the graph with six vertices, a bridge, and a loop.

14. Represent the floor plan below as a graph where each vertex represents a room and each edge represents a doorway between rooms.

15. a. c. b. d.

16. a. c. b. d.

17. Draw a connected graph with all even vertices.b. d.

18. Draw a connected graph with all even vertices.b. d.

19. Practice Problems