1 / 14

Discrete Maths

Discrete Maths. Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…. Where graph theory came from…. Where graph theory came from…. Let’s learn some definitions…. Trail (or route). Closed Trail. Path. Cycle. Order. Connected Graph. A. A. C. C. B. B. E. D. D. Eulerian Graph.

teegan-chandler
Download Presentation

Discrete Maths

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. Discrete Maths Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…

  2. Where graph theory came from…

  3. Where graph theory came from…

  4. Let’s learn some definitions…

  5. Trail (or route)

  6. Closed Trail

  7. Path

  8. Cycle

  9. Order

  10. Connected Graph

  11. A A C C B B E D D Eulerian Graph • A connected graph which has a closed trail containing every arc precisely once • CHECK: A connected graph is Eulerian if and only if every node has an even order √ X

  12. A F B D E C A wee puzzle…

  13. A F B D E C Semi-Eulerian Graph • A graph which has a trail that is not closed that contains every arc precisely once • CHECK: A connected graph is Semi-Eulerian if and only if precisely two nodes have odd order

More Related