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 bipartite graph K2,11 have?

K2,11
|E| =
2.Easy
ABCDE

Exactly one vertex of the graph has degree 2. Click it.

deg = 2
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
3.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 =
4.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| = 5
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
5.Hard
ABCDEF

How many closed walks of length 2 start and end at F? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =
6.Hard
1411315418126ABCDEF

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 6|E| = 9
W =

Answer key

  1. 1. |E| = 22
  2. 2. D
  3. 3. H = 2520
  4. 4. Euler path, no circuit
  5. 5. N = 2
  6. 6. W = 27

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