Year 12 Graph Theory Summative Assessment

Year 12 Graph Theory Summative Assessment

12th Grade

20 Qs

quiz-placeholder

Similar activities

14.2

14.2

9th - 12th Grade

18 Qs

networks 1

networks 1

12th Grade

17 Qs

Year 12 Further Maths - Chapter 14 Test 1 - Networks

Year 12 Further Maths - Chapter 14 Test 1 - Networks

12th Grade

18 Qs

Graphs and Networks - Glossary

Graphs and Networks - Glossary

12th Grade

22 Qs

Euler Paths and Circuits

Euler Paths and Circuits

9th - 12th Grade

21 Qs

Graph Theory Basics

Graph Theory Basics

9th - 12th Grade

18 Qs

Unit 4.2-1 General Maths - Graphs and Networks

Unit 4.2-1 General Maths - Graphs and Networks

12th Grade

19 Qs

Mathematics Form 4 Chapter 5 [Network in Graph Theory]

Mathematics Form 4 Chapter 5 [Network in Graph Theory]

10th - 12th Grade

18 Qs

Year 12 Graph Theory Summative Assessment

Year 12 Graph Theory Summative Assessment

Assessment

Quiz

Mathematics

12th Grade

Hard

Created by

Victoria Stockl

Used 3+ times

FREE Resource

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Which of the following statements is false?

The sum of degrees of the vertices is equal to twice the number of edges in any graph

A loop contributes two degrees to a vertex because a loop is attached to its vertex at both ends.

A subgraph cannot contain any isolated vertices

A simple graph does not contain any loops or duplicate or multiple edges

A complete graph contains edges between every pair of vertices

2.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

Is it possible to trace out a continuous walk that crosses each of the Königsberg bridges only once?

No because graph has only one two even vertices

  1. Yes because the graph has only two odd vertices

No because the graph has only odd vertices

Yes because the graph has only even vertices

None of the above

3.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

What is the degree of vertex E?

1

2

3

4

5

4.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

An Euler Circuit:

passes through each vertex once only and starts and finishes at the same vertex.

passes along each edge once only and starts and finishes at the same vertex.

passes through each vertex once only and starts and finishes at different vertices.

  1. passes along each edge once only and starts and finishes at different vertices.

starts and finishes at different vertices.

5.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Media Image

The length of the shortest path from F to B in the network shown is

15

16

17

18

19

6.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

For which one of the following graphs is the sum of the degrees of the vertices equal to 16?

Media Image
Media Image
Media Image
Media Image
Media Image

7.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

A Hamilton circuit:

passes through each vertex once only and starts and finishes at the same vertex.

passes along each edge once only and starts and finishes at the same vertex.

passes through each vertex once only and starts and finishes at different vertices.

passes along each edge once only and starts and finishes at different vertices.

starts and finishes at different vertices.

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?