1 / 19

Graph Theory

Graph Theory . A Presentation By: Jillian Minuto Troy Norman Alan Leggett Group Advisor: Prof. G. Warrington. f(x )=x 3 -7. A function f is a relation such that f A x B. …Look Familiar?. It’s a graph!. Route of a single bus in Burlington. c.

marli
Télécharger la présentation

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 A Presentation By: Jillian Minuto Troy Norman Alan Leggett Group Advisor: Prof. G. Warrington

  2. f(x)=x3-7 A function f is a relation such that f A x B

  3. …Look Familiar?

  4. It’s a graph!

  5. Route of a single bus in Burlington c • A simple graph G is a pair G=(V,E) where • V is a finite set of vertices of G • E is a finite set of two-element subsets of V, called the edges of G • Here V = {1,2,3,4} E={ a, b, c, d } • {(1,2) (1,3)(3,2)(2,4)} d b a

  6. Degree of a Vertex Route of a single bus in Burlington • d(3)=2 • d(4)=1 c d b a • d(1)=2 • d(2)=3 Since all vertices have a degree ≥ 1, this is called a connected simple graph

  7. Degree of a Vertex Route of all buses in Burlington • d(1)=3 • d(2)=6 • d(3)=4 • d(4)=1

  8. Path – distinct edges and vertices Distinct edges only - Trail Path ⇒ Trail ⇒ Walk ✔ ✗ Walk ⇏ Trail ⇏ Path Where length l is defined as the number of edges traveled Walk – non-distinct edges and vertices Trail starts and ends at the same vertex - Circuit

  9. Eulerian Graphs

  10. Eulerian Circuit • A graph that can be drawn using every edge exactly once and ends at the initial vertex

  11. Eulerian Trail • A graph that can be drawn using every edge exactly once and ending at a different vertex than the initial.

  12. KonigsbergBridges • Asks whether or not you can cross each of the bridges once and return to the starting point.

  13. Euler’s Contribution • Euler was able to prove that the problem of the KonigsbergBridges was not possible. • From his findings he developed a simple theorem on whether or not a graph is Eulerian.

  14. Euler’s Theorem • A connected graph G has an Eulerian circuit if and only if the degree of each vertex of G is even.

  15. Proof of Euler’s Theorem

  16. Euler’s Theorem • A connected graph G has an Eulerian circuit if and only if the degree of each vertex of G is even.

  17. Homework a) You and your friend take a trip to Konigsberg, if possible design a path that allows you to see the entire city and cross each bridge once and only once. b) Suppose that one fewer bridge was built in the city of Konigsberg, as shown. Design a route that allows for you to see the whole city while crossing each bridge once and only once. c) Does it matter which bridge is removed? If not, provide an example. d) Could you add a bridge(s) that would also make this task possible? If yes, provide an example.

  18. Sources: • Wilson, Robin J. "Chapter 3/Eulerian Graphs." Introduction to Graph Theory. Harlow: Longman, 1996. 31-33. Print. • Agnarsson, Geir, and RaymondChaGreenlaw. "Chapter 5/Eulerian Graphs." Graph Theory: Modeling, Applications, and Algorithms. Upper Saddle River, NJ: Pearson/Prentice Hall, 2007. 135-37. Print. • http://www.math.lsa.umich.edu/mmss/coursesONLINE/graph/graph1/index.html • http://understandingsociety.blogspot.com/2011/04/math-of-social-networks.html

More Related