Loading [MathJax]/jax/element/mml/optable/BasicLatin.js

User interface language: English | Español

Date May 2016 Marks available 3 Reference code 16M.3dm.hl.TZ0.5
Level HL only Paper Paper 3 Discrete mathematics Time zone TZ0
Command term Show that Question number 5 Adapted from N/A

Question

The simple, connected graph G has e edges and v vertices, where v3.

Given that both G and G are planar and connected,

Show that the number of edges in G, the complement of G, is 12v212ve.

[2]
a.

show that the sum of the number of faces in G and the number of faces in G is independent of e;

[3]
b.

show that v213v+240 and hence determine the maximum possible value of v.

[7]
c.

Markscheme

the total number of edges in G and G is v(v1)2     (A1)

the number of edges in G=v(v1)2e     A1

=12v212ve    AG

[2 marks]

a.

using Euler’s formula, number of faces in G=e+2v     A1

number of faces in G=v22v2e+2v     A1

sum of these numbers =v225v2+4     A1

this is independent of e     AG

[3 marks]

b.

for G to be planar, we require     (M1)

e3v6    A1

for e3v6 to be planar, we require

v22v2e3v6    A1

for these two inequalities to be satisfied simultaneously, adding or substituting we require

v22v26v12    (M1)A1

leading to v213v+240     AG

the roots of the equation are 10.8 (and 2.23)     (A1)

the largest value of v is therefore 10     A1

[7 marks]

c.

Examiners report

Generally in this question, good candidates thought their way through it whereas weak candidates just wrote down anything they could off the formula booklet or drew pictures of particular graphs. It was important to keep good notation and not let the same symbol stand for different things.

(a) If they considered the complete graph they were fine.

a.

Generally in this question, good candidates thought their way through it whereas weak candidates just wrote down anything they could off the formula booklet or drew pictures of particular graphs. It was important to keep good notation and not let the same symbol stand for different things.

(b) Some confusion here if they were not clear about which graph they were applying Euler’s formula to. If they were methodical with good notation they obtained the answer.

b.

Generally in this question, good candidates thought their way through it whereas weak candidates just wrote down anything they could off the formula booklet or drew pictures of particular graphs. It was important to keep good notation and not let the same symbol stand for different things.

(c) Again the same confusion about applying the inequality to both graphs. Most candidates realised which inequality was applicable. Many candidates had the good exam technique to pick up the last two marks even if they did not obtain the quadratic inequality.

c.

Syllabus sections

Topic 10 - Option: Discrete mathematics
Show 214 related questions

View options