Graphs and Networks 1 (AQA A-Level Further Maths): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
What is a walk in graph theory?
What is a walk in graph theory?
Journey w/ no restrictions on repeating
What distinguishes a trail from a walk?
What distinguishes a trail from a walk?
In a trail, no edge is repeated
What defines a path in graph theory?
What defines a path in graph theory?
No edges or vertices repeated
What is a cycle?
What is a cycle?
Closed path w/o repeating edges/vertices
What is a Hamiltonian cycle?
What is a Hamiltonian cycle?
Cycle visiting every vertex exactly once
When is a graph Eulerian?
When is a graph Eulerian?
All vertices have even degree
When is a graph semi-Eulerian?
When is a graph semi-Eulerian?
Exactly 2 vertices have odd degree
A graph has vertices with degrees . What type is it?
A graph has vertices with degrees . What type is it?
Non-Eulerian
Why must the number of odd degree vertices always be even?
Why must the number of odd degree vertices always be even?
Sum of degrees = edges (even)
A graph has degrees , , , . Where must a trail start and end?
A graph has degrees , , , . Where must a trail start and end?
Start at B, end at D (or vice versa)