Graph theory worksheet with answers

Free printable Graph theory worksheet: 6 problems from easy to exam level, with an answer key. Print it or save it as a PDF.

New worksheetPractise online with hints

For teachers: free to print, copy and use in class. Every new worksheet has new values and its own answer key. A link to ExamProblems on your course page is appreciated.

Name: ____________________   Date: ____________

1.Easy

A tree has 14 edges. How many vertices |V| does it have?

|E| = 14
|V| =
2.Easy

How many edges |E| does the complete graph K5 have?

K5
|E| =
3.Medium
ABCDEEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
4.Medium

How many different Hamilton circuits H does the complete graph K8 have? Circuits that differ only in the starting vertex or the direction count as the same.

K8
H =
5.Hard
1618151721410ABCDEF

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 5; skipped edges do not count.

k = 5
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge EF
  8. 8edge BE
6.Hard
351158171110ABCDEF

Prim’s algorithm builds a minimum spanning tree starting from vertex D. Click the edge it adds as edge number 3.

start: Dk = 3
  1. 1edge AC
  2. 2edge BC
  3. 3edge BD
  4. 4edge CE
  5. 5edge DE
  6. 6edge DF
  7. 7edge EF
  8. 8edge BE

Answer key

  1. 1. |V| = 15
  2. 2. |E| = 10
  3. 3. Euler circuit
  4. 4. H = 2520
  5. 5. edge EF
  6. 6. edge AC

Full step-by-step solutions: practise this topic on examproblems.com.