Lesson 7.02a-e
7.02a-e Graph terminology, complete and bipartite graphs Quiz: OCR Further Maths, Unit 4
20 questions
In partnership with Revision Ninja
Lesson 7.02a-e, Graph terminology, complete and bipartite graphs: 20 multiple choice questions for the OCR Further Maths (H245), Unit 4: Discrete Mathematics (Y544), written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
What is the sum of the degrees of all vertices in a graph with 12 edges?
- 6
- 144
- 12
- 24
-
How many edges are in the complete graph K6?
- 30
- 12
- 36
- 15
-
How many edges are in the complete bipartite graph K3,5?
- 16
- 15
- 8
- 30
-
Which term describes a graph with no loops and no multiple edges?
- Complete graph
- Bipartite graph
- Simple graph
- Connected graph
-
What is the maximum number of edges in a bipartite graph with 4 vertices in each set?
- 12
- 16
- 28
- 8
-
What can be deduced about the number of odd-degree vertices in any graph?
- It is even
- It equals edges
- It is odd
- It is zero
-
What term describes a graph where a path exists between every pair of vertices?
- Regular
- Bipartite
- Complete
- Connected
-
How many edges does a tree with 10 vertices contain?
- 11
- 10
- 45
- 9
-
What name is given to a graph where every vertex has the same degree?
- Regular graph
- Complete graph
- Simple graph
- Isomorphic graph
-
What is the degree of every vertex in the complete graph K8?
- 7
- 28
- 8
- 14
-
What type of cycles can never exist in a bipartite graph?
- Eulerian cycles
- Odd cycles
- Hamiltonian cycles
- Even cycles
-
What is a walk with no repeated vertices called?
- Path
- Circuit
- Cycle
- Trail
-
What is a walk with no repeated edges called?
- Path
- Cycle
- Tree
- Trail
-
What term describes a graph whose vertices and edges are all subsets of another graph?
- Tree
- Isomorphic graph
- Subgraph
- Bipartite graph
-
If a complete graph Kn has 21 edges, what is the value of n?
- 8
- 6
- 7
- 21
-
What term describes two graphs that have the same structure and connectivity?
- Bipartite
- Complete
- Isomorphic
- Equivalent
-
What property must every vertex in a connected graph have to be Eulerian?
- Odd degree
- Equal degree
- Even degree
- Degree 2
-
What is the sum of all vertex degrees in the complete bipartite graph K4,5?
- 9
- 18
- 20
- 40
-
How many edges are in a simple cycle graph Cn with n vertices?
- n - 1
- n + 1
- 2n
- n
-
What is the maximum number of vertices in a complete graph with at most 10 edges?
- 4
- 5
- 10
- 6
Related quizzes
- Existence problems, set notation and the pigeonhole principle Quiz · 7.01a-c · 20 questions
- Arrangements, multiplicative principle and inclusion-exclusion Quiz · 7.01d-k · 20 questions
- Eulerian and Hamiltonian graphs, isomorphism, digraphs, planarity and networks Quiz · 7.02g-p · 20 questions
- Algorithms, tracing and efficiency Quiz · 7.03a-e · 20 questions
- Sorting algorithms and bin packing Quiz · 7.03i-m · 20 questions
- Shortest paths, minimum spanning trees and nearest neighbour Quiz · 7.04a-c · 20 questions
- Route inspection and choosing a network algorithm Quiz · 7.04e-f · 20 questions
- Critical path analysis Quiz · 7.05a · 20 questions
- Formulating linear programming problems and slack variables Quiz · 7.06a-b · 20 questions
- Graphical solutions and the effect of changing constraints Quiz · 7.06c-e · 20 questions