1 / 13

Graph Theory

Graph Theory. What is Graph Theory?. This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’ (or ‘nodes’) connected by ‘edges’ (or ‘arcs’). edge. vertex. Why is it useful?.

kacy
Download Presentation

Graph Theory

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Graph Theory

  2. What is Graph Theory? This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’ (or ‘nodes’) connected by ‘edges’ (or ‘arcs’). edge vertex

  3. Why is it useful? Real life problems and problems from other areas of mathematics can be turned into Graph Theory problems. Chinese postman problem Shortest path problem Travelling salesman problem Museum guard problem Optimising computer networks Map colouring problem Königsberg bridge problem The theorems and knowledge about Graph Theory can then help us solve these problems.

  4. Six Degrees of Kevin Bacon The ‘Shortest Path Problem’ applied to the Six Degrees of Kevin Bacon. Actors are represented as vertices. If two actors are in the same film or TV show they are connected by an edge. An actor’s ‘Bacon Number’ is the degrees of separation he is from Kevin Bacon. In other words, the fewest edges that must be travelled to get to the Kevin Bacon vertex.

  5. Six Degrees of Kevin Bacon Christopher Plummer 2 Kevin Bacon has an index of 0 Elvis was in Change of Habit with Asner but was never in a film with KB so has an index of 2 Kevin Bacon 0 Of course all these actors were in films with many other actors, so the graph is much larger. Edward Asner 1 Edward Asner was in the film JFK with KB so has an index of 1 Tom Hanks 1 Elvis Presley 2 Gary Sinese 1 Jordan Nagai 2

  6. Leonhard Euler • 1707-1783 • Swiss • Contributed to many areas of maths: • Optics • Graph theory • Great at mental maths • Photographic memory • Devout Christian • e iπ= -1

  7. Königsberg Bridges Historical problem ‘solved’ by Euler in 1735. A C B D Can you walk around the city crossing each bridge exactly once?

  8. The city can be represented as a graph. Start at one vertex and see if you can ‘walk’ over all the edges exactly once. A What happens if you remove an edge? Does it matter which edge you remove? Why are some bridge problems solvable and some not? C B D

  9. William Rowan Hamilton • 1805-1865 • Irish • Contributed to many areas of maths: • Optics • Mechanics • Graph theory • Algebra • Great linguist

  10. A Hamiltonian cycle or circuit is a path that takes you through every vertex exactly once and finish where you started. Hamilton invented a mathematical game in 1857 using a dodecahedron. You had to find a path around the edges so that you visit each vertex once and only once.

  11. These is easier to manage in 2-dimensions if we draw the dodecahedron as below.

  12. Can you find Hamilton Circuits for the vertices of other 3D shapes?

More Related