Your SlideShare is downloading. ×
0
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Graphs

183

Published on

A gentle introduction of Graph Theoretic Concepts

A gentle introduction of Graph Theoretic Concepts

Published in: Education, Technology
0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
183
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
9
Comments
0
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. L6FM1 Further MathsDiscrete/Decision Maths Dr Cooper (NSC)
  • 2. Graph Theory
  • 3. Graph Theory
  • 4. Graph Theory
  • 5. Biochemical Networks
  • 6. Graph TheoryA graph (network) is a collectionof nodes (also called vertices,shown by blobs) connected byarcs (or edges or legs, shownby straight or curved lines)
  • 7. Graph TheoryA graph (network) is a collectionof nodes (also called vertices,shown by blobs) connected byarcs (or edges or legs, shownby straight or curved lines) Graphs can used to represent oil flow in pipes, traffic flow on motorways, transport of pollution by rivers, groundwater movement of contamination, biochemical pathways, the underground network, etc
  • 8. Graph TheorySimple graphs do not haveloops or multiple arcs betweenpairs of nodes. Most networks inD1 are Simple graphs.
  • 9. Graph TheorySimple graphs do not haveloops or multiple arcs betweenpairs of nodes. Most networks inD1 are Simple graphs.
  • 10. Graph TheoryA complete graphs is one inwhich every node is connected K4to every other node. The notationfor the complete graph with nnods is Kn
  • 11. Graph TheoryA subgraph can be formed by removing arcs and/or nodesfrom another graph. Graph Subgraph
  • 12. Graph TheoryA bipartite graph is a graph in which there are 2 sets ofnodes. There are no arcs within either set of nodes.
  • 13. Graph TheoryA complete bipartite graph is a bipartite graph in which …
  • 14. Graph TheoryA complete bipartite graph is a bipartite graph in whichevery node in one set is connected to every node in the otherset
  • 15. Graph Theory BThe order of a node is the number Cof arcs meeting at that node. A DIn the subgraph shown, A and Fhave order 2, B and C have order 3 Fand D has order 4. A, D and F haveeven order, B and C odd order.Since every arc adds 2 to the totalorder of all the nodes, this total isalways even.
  • 16. Graph Theory BA connected graph is one for Cwhich a path can be found between Aany two nodes. D XThe illustrated graph is NOT Y Fconnected. Z
  • 17. Graph Theory E BAn Eulerian Graph has every Cnode of even order. A DEuler proved that this was identicalto there being a closed trail Fcontaining every arc preciselyonce. e.g. BECFDABCDB
  • 18. Graph Theory BA semi-Eulerian Graph has Cexactly two nodes of odd order. A DSuch graphs contain a non-closedtrail containing every arc precisely Fonce.
  • 19. Graph Theory BA semi-Eulerian Graph has Cexactly two nodes of odd order. A DSuch graphs contain a non-closedtrail containing every arc precisely Fonce.Such a trail must start at one oddnode and finish at the other.e.g. BADBCDFC
  • 20. Konigsberg Bridges
  • 21. Konigsberg Bridges

×