A-Level Maths
Courses
Papers
Questions
Search
Courses
Decision Mathematics
Graph Theory Fundamentals
Q7
AQA D1 2015 June — Question 7
2 marks
Exam Board
AQA
Module
D1 (Decision Mathematics 1)
Year
2015
Session
June
Marks
2
Topic
Graph Theory Fundamentals
7
A simple connected graph has 4 edges and \(m\) vertices. State the possible values of \(m\).
A simple connected graph has \(n\) edges and 4 vertices. State the possible values of \(n\).
A simple connected graph, \(G\), has 5 vertices and is Eulerian but not Hamiltonian. Draw a possible graph \(G\).
[0pt] [2 marks]
This paper
(9 questions)
View full paper
Q1
5
Q2
2
Q3
Q4
2
Q5
Q6
1
Q7
2
Q8
Q9
10