First Theorem of Directed Graphs | Digraph Theory

Описание: Support the production of this course by joining Wrath of Math to access all my graph theory videos!
   / @wrathofmath  
🛍 Check out the coolest math clothes in the world: https://mathshion.com/

Graph Theory course:    • Graph Theory  
Graph Theory exercises:    • Graph Theory Exercises  

Get the textbook! https://amzn.to/3HvI535

The first theorem of graph theory tells us that the degree sum of a graph is two times the number of edges, or two times its size. A similar theorem is true in directed graph theory, or digraph theory. This theorem states that the sum of the outdegrees of the vertices in a digraph equals the sum of the indegrees, and they're both equal to m, the size of the digraph (the number of directed edges/arcs it has). We'll go over why this theorem is true in today's lesson!

Intro to directed graphs:    • Intro to Directed Graphs | Digraph Theory  
First Theorem of Graph Theory:    • The First Theorem of Graph Theory | Graph ...  

◆ Donate on PayPal: https://www.paypal.me/wrathofmath
◆ Support Wrath of Math on Patreon:   / wrathofmathlessons  

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu