Discrete Mathematics 5: Graphs and Eulerian Paths

Channel:
Subscribers:
157
Published on ● Video Link: https://www.youtube.com/watch?v=2QKjZb9ZKYg



Duration: 8:53
2,919 views
0


In this video, I'll be covering graphs, one of my favorite topics in discrete mathematics. The next few videos will also be related to graphs, because the topic is pretty big, and really important for computer programming. This is just an introduction to the topic.

Also, I go through a really fast proof of Eulerian Paths. I don't want to slow down too much to explain proofs, so hopefully it made sense, but if not, you should take away that there are things we can prove about certain types of graphs, and they can help us solve practical problems such as whether we can cross bridges without having to see the same view twice.







Tags:
Eulerian Path (Mathematical Concept)
Graph
Discrete Mathematics
Mathematics (Programming Language Paradigm)
isomorphism
cliques
cycles