Edexcel Decision Maths 1 - Definitions

Edexcel Decision Maths 1 - Definitions

11th Grade - University

20 Qs

quiz-placeholder

Similar activities

Hamiltonian Circuits - Discrete Ch 2

Hamiltonian Circuits - Discrete Ch 2

11th - 12th Grade

15 Qs

Year 12 Further Maths - Chapter 14 Test 1 - Networks

Year 12 Further Maths - Chapter 14 Test 1 - Networks

12th Grade

18 Qs

Unit 2 - Graph Theory

Unit 2 - Graph Theory

University

25 Qs

AQR: Unit 7 Activity 4, 6, & 7 Quiz

AQR: Unit 7 Activity 4, 6, & 7 Quiz

11th - 12th Grade

15 Qs

Unit 7 Quiz 1 Review

Unit 7 Quiz 1 Review

12th Grade

20 Qs

Graphs and Network Progress Quiz

Graphs and Network Progress Quiz

9th - 12th Grade

24 Qs

QUIZ 3 TSP4113 (2430)

QUIZ 3 TSP4113 (2430)

University

16 Qs

Euler and Hamilton (Paths and Cricuits)

Euler and Hamilton (Paths and Cricuits)

11th Grade

18 Qs

Edexcel Decision Maths 1 - Definitions

Edexcel Decision Maths 1 - Definitions

Assessment

Quiz

Mathematics

11th Grade - University

Medium

Used 35+ times

FREE Resource

20 questions

Show all answers

1.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Select all the words that define "the number of edges incident to a vertex".

Degree

Order

Node

Weight

Valency

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A _________ of G is a graph, each of whose vertices belongs to G and each of whose edges belongs to G.

Subgraph

Tree

Vertex

Minimum Spanning Tree

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Another name for a vertex is... ?

Node

Degree

Valency

Order

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Another name for an edge is... ?

Arc

Node

Vertex

Face

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and in which no vertex appears more than once.

Path

Walk

Trail

Cycle

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

A path in which you are permitted to return to vertices more than once.

Walk

Trail

Cycle

Hamiltonian cycle

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A walk which visits every vertex, returning to its starting vertex.

Tour

Path

Digraph

Tree

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?