w5l1.intro to graphs · an edge if team a beats team b. this graph is a simple directed graph,...
TRANSCRIPT
![Page 1: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/1.jpg)
W5L1.Introduction to Graph Theory
Reference book: Discrete Mathematics. K.Rosen
![Page 2: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/2.jpg)
Types of graphs
![Page 3: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/3.jpg)
Types of graphs
![Page 4: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/4.jpg)
Directed graphs
![Page 5: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/5.jpg)
Summary of graph types
![Page 6: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/6.jpg)
Real life applications
![Page 7: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/7.jpg)
Real life applications
![Page 8: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/8.jpg)
Real life applications
![Page 9: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/9.jpg)
Real life applications
![Page 10: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/10.jpg)
Real life applications
![Page 11: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/11.jpg)
Real life applications
![Page 12: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/12.jpg)
Basic concepts
![Page 13: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/13.jpg)
Example
![Page 14: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/14.jpg)
How to calculate?
![Page 15: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/15.jpg)
In-Out degree
![Page 16: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/16.jpg)
Example
![Page 17: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/17.jpg)
Some special graphs
![Page 18: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/18.jpg)
Special graphs
![Page 19: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/19.jpg)
Applications of special graphs
![Page 20: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/20.jpg)
Applications of special graphs
![Page 21: W5L1.Intro to graphs · an edge if team a beats team b. This graph is a simple directed graph, containing no loops or multiple directed edges (because no two teams play each other](https://reader036.vdocument.in/reader036/viewer/2022081403/60a25644c7237d2090542365/html5/thumbnails/21.jpg)