Omniadisce

Applied maths 6.5: Graphs and networks

Lesson Beginner

Join free to take this lesson

Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.

11 steps ยท about 18 min

By the end you can

  • Use degrees and the handshake lemma to count edges
  • Decide whether a network has a route using every link exactly once
  • Know that a tree on n vertices has n โˆ’ 1 edges, and find a shortest path

Who it is for: You have done lesson 6.4 (counting).

The steps

  1. Handshakes at a party
  2. Degrees and the handshake lemma
  3. Count the cables
  4. Sum of degrees
  5. Euler routes
  6. Can the inspector do it?
  7. Trees
  8. Connect the villages
  9. Shortest paths
  10. Find the shortest route
  11. An odd number of odd vertices?

Discussion 0 comments

Log in to join the discussion.

× Enlarged view