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

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

K11
|E| =
2.Easy

A simple graph has 5 vertices with degrees 3, 2, 2, 2, 1. How many edges |E| does it have?

deg: 3, 2, 2, 2, 1
|E| =
3.Medium
ABCDEFGEuler 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| = 7|E| = 10
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
4.Medium

A tree has 4 vertices of degree 3, 3 vertices of degree 4, 3 vertices of degree 5, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

4 × deg 33 × deg 43 × deg 52 × deg 2
L =
5.Hard
11135771113511ABCDEF

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =
6.Hard
3269314539ABCDEFG

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 3; A itself is round 1.

start: Around 3
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F
  7. 7G

Answer key

  1. 1. |E| = 55
  2. 2. |E| = 5
  3. 3. neither
  4. 4. L = 21
  5. 5. d(F) = 25
  6. 6. B

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