Section 6.

Introduction to
Graphs

Animations

6.1 Introduction to Graphs 1

 Konigsberg Bridge Problem

Rules
A 1.

B D 2.

C
6.1 Introduction to Graphs 2
 Your solution

1. Did it every time

2. Did it at least once

3. Can’t seem to do it

6.1 Introduction to Graphs 3

Konigsberg Bridge
(8th bridge)

6.1 Introduction to Graphs 4

 Your solution

1. Did it every time

2. Did it at least once

3. Can’t seem to do it

6.1 Introduction to Graphs 5

Konigsberg Bridge
(9th bridge)

6.1 Introduction to Graphs 6

 Your solution

1. Did it every time

2. Did it at least once

3. Can’t seem to do it

6.1 Introduction to Graphs 7

 3 Cases for Konigsberg

1. 7 Bridges (Non-traversable) Picture

2. 8 Bridges (Euler Path) Picture

3. 9 Bridges (Euler circuit) Picture

6.1 Introduction to Graphs 8

 Euler’s View

Map Graph

A
B
C

6.1 Introduction to Graphs 9

 You try one

A Graph

River
Island
Island
B C

6.1 Introduction to Graphs 10

 Definition - Graph

A graph is any collection of

• Dots (Vertices)

• Arcs/Lines (Edges) that join the points

Examples

6.1 Introduction to Graphs 11

 Two Special Cases

1. Loops

2. Isolated Points
D B C

We will avoid isolated

points
6.1 Introduction to Graphs 12
 The Degree of a Vertex
The degree of a vertex is the number of times the
vertex is touched by an edge

Degree Evenness/ A

A oddness
E B

C
D C
D

Counting vertices, edges, degrees applet

6.1 Introduction to Graphs 13

This graph has

1. 6 edges, 4 vertices (exactly 2 of which are odd)

2. 4 edges, 6 vertices (all of which are odd)
3. 6 edges, 4 vertices (all of which are odd)
4. 4 edges, 4 vertices (exactly 2 of which are odd)

6.1 Introduction to Graphs 14

This graph has
E
A
1. 8 edges, 5 vertices (none of which are odd)
C
2. 8 edges, 5 vertices (exactly 2 of which are odd) B
3. 8 edges, 5 vertices (exactly 4 of which are odd)
4. 8 edges, 5 vertices (all of which are odd) D

6.1 Introduction to Graphs 15

 Draw a graph with

A. 4 vertices (all odd) and 5 edges

B. 4 vertices (all odd) and 3 edges (no loops)

6.1 Introduction to Graphs 16

 Draw a graph with

C. 3 vertices (exactly 1 even) and 4 edges

D. 3 vertices (exactly 1 odd) and 4 edges

6.1 Introduction to Graphs 17

 All vertices of a graph could be odd

1. True

2. False

6.1 Introduction to Graphs 18

 All vertices of a graph could be even

1. True

2. False

6.1 Introduction to Graphs 19

End of 6.1

6.1 Introduction to Graphs 20

1. GRAPHS Lots of explorations. Discovery. Hit theory a
bit harder. Discover sum og degrees in agrpah is even.,
etc

6.1 Introduction to Graphs 21

 7 bridges

2 islands

SPLAT!
Arrrgh!
Expletive
deleted!

Ouch!
6.1 Introduction to Graphs 22
 7 bridges

2 islands

I did it!

But…

6.1 Introduction to Graphs 23

 7 bridges

2 islands

I did it! I did it!

And …

6.1 Introduction to Graphs 24

Leonard Euler
(“Oiler”)
1706 - 1783

6.1 Introduction to Graphs 25

Non-traversable

6.1 Introduction to Graphs 26

 Euler Path

6.1 Introduction to Graphs 27

Euler Circuit

6.1 Introduction to Graphs 28

 Genealogy
Abraham
Lincoln

Bathsheba Thomas
Herring Lincoln

James Nancy
Hanks Hanks

16th President
Abraham Lincoln
Lucy
Shipley Vertices =
Edges =

6.1 Introduction to Graphs 29

 Constellations

Vertices =
Edges =

6.1 Introduction to Graphs 30

The nine members of the Supreme Court in 1973 were
Justices Marshall, Burger, White, Blackman, Powell,
Rhenquist, Brennan, Douglas, and Stewart. The
conservative block of Burger, Rhenquist, Powell and
Blackman voted together on 70+ percent of the votes.
Justice White joined with Justice Blackman 70+ percent
of the time. The liberal block of Brennan, Douglas, and
Marshall voted together 70+ percent of the time. Justice
Stewart was the maverick who voted with no one 70+
percent of the time

6.1 Introduction to Graphs 31

 Political Science

Blackman Rhenquist
Douglas

Marshall Brennan White

Powell
Stewart Burger

Vertices =
Edges =
6.1 Introduction to Graphs 32
Meta - Material

6.1 Introduction to Graphs 33