7.02b Graph terminology: tree, simple, connected, simply connected

76 questions

Sort by: Default | Easiest first | Hardest first
Edexcel FD1 AS 2019 June Q1
6 marks Easy -1.2
  1. Draw the graph \(K_5\) [1]
    1. In the context of graph theory explain what is meant by 'semi-Eulerian'.
    2. Draw two semi-Eulerian subgraphs of \(K_5\), each having five vertices but with a different number of edges. [3]
  3. Explain why a graph with exactly five vertices with vertex orders 1, 2, 2, 3 and 4 cannot be a tree. [2]