DP Math AI · HL · Geometry and Trigonometry · Updated

AHL 3.14—Graph theory

Get started
Free preview 2/14
  1. Question 1

    A graph has 7 vertices with degrees 2, 2, 2, 3, 3, 4, 4. How many edges does the graph have?
    No clue? Show me the answer
    Correct answerCorrect!Incorrect
    A10

    Step-by-step walkthrough

    Choose a solution method

    Method #1Worked solution

    Step 1: Recall the Handshaking Lemma

    The sum of all vertex degrees equals .

    Step 2: Sum the degrees

    .

    Step 3: Divide by 2

    .

    Step 4: State the answer

    The graph has edges.

    Method #2Why the others are wrong

    Step 1: Option B

    is the sum of degrees, not divided by 2 - forgetting to halve.

    Step 2: Option C

    would come from miscounting one degree value when summing.

    Step 3: Option D

    does not correspond to any correct or half-correct calculation of this sum.

    Step 4: Confirm correct choice

    Only satisfies the Handshaking Lemma correctly.

  2. Question 2

    In the complete graph , what is for any vertex ?
    No clue? Show me the answer
    Correct answerCorrect!Incorrect
    B5

    Step-by-step walkthrough

    Choose a solution method

    Method #1Worked solution

    Step 1: Recall complete graph property

    In , every vertex connects to every other vertex exactly once.

    Step 2: Count neighbours

    With , each vertex connects to the remaining vertices.

    Step 3: Determine degree

    Therefore for every vertex.

    Step 4: State answer

    The degree of any vertex in is .

    Method #2Why the others are wrong

    Step 1: Option B

    mistakenly counts the vertex itself as a neighbour, using instead of .

    Step 2: Option C

    is the total number of edges in (), not a vertex degree.

    Step 3: Option D

    is the sum of all degrees (), not an individual degree.

    Step 4: Confirm correct choice

    Only correctly represents an individual vertex's degree.

Free preview

12 more questions in this topic

Checking your topic access