Graph theory - The Königsberg bridge problem

Graph theory - The Königsberg bridge problem

9th - 12th Grade

7 Qs

quiz-placeholder

Similar activities

G8DV

G8DV

9th - 12th Grade

10 Qs

Geometry Quiz 1 Review

Geometry Quiz 1 Review

10th Grade

12 Qs

Comparing Dot Plots and Box Plots

Comparing Dot Plots and Box Plots

6th - 9th Grade

12 Qs

Make a decision!

Make a decision!

11th - 12th Grade

12 Qs

TLAC Summary: 7. The Tower of Epiphany

TLAC Summary: 7. The Tower of Epiphany

12th Grade

10 Qs

Exercise 13E  - Finding the shortest path

Exercise 13E - Finding the shortest path

12th Grade

8 Qs

Year 12 GM - Network

Year 12 GM - Network

12th Grade

9 Qs

Networks August 15

Networks August 15

12th Grade

12 Qs

Graph theory - The Königsberg bridge problem

Graph theory - The Königsberg bridge problem

Assessment

Quiz

Mathematics

9th - 12th Grade

Hard

Created by

Kinga Kisded

Used 3+ times

FREE Resource

7 questions

Show all answers

1.

FILL IN THE BLANK QUESTION

2 mins • 1 pt

The Königsberg bridge problem was solved by _______.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The 'Geometry of Position' is known as which brand of Mathematics?

Node theory

Graph theory

Relativity theory

Location theory

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

What do the nodes represent in the problem?

The bridges

The possible routes

The landmasses

The bridges you have to cross twice

4.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

What do the lines represent in the problem?

The possible route

The bridges

Eulerian path

Eulerian circle

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the degree of a node?

The number of edges starting from the node.

The number of nodes that are connected to the original node.

It doesn't mean anything, we only use it to distinguish the nodes.

The number of times we have to go through a node when completing an Eulerian path.

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Euler proved that it is only possible to find an Eulerian path in a graph if there are

an even number of nodes of odd degree

at most two nodes of odd degree

exactly two nodes of odd degree

at least two nodes of odd degree

7.

MULTIPLE SELECT QUESTION

45 sec • 1 pt

If the degrees of all nodes are even, we can find a _________ in the graph.

circuit

Eulerian circuit

Eulerian path

path