Euler's Handshaking Lemma Proof In Under A Minute
3.5 هزار بار بازدید -
3 سال پیش
-
#ShortsHi,In this
#Shorts
Hi,
In this video I'll be stating and proving Euler's handshaking lemma, all to do with graphs and graph theory. This lemma says that for any graph, the sum of the degrees of all vertices in a graph is equal to twice the number of edges in the graph. In particular, this tells us that the sum of the degrees of the graph must be even.
Want to send me a fun maths problem or theorem, or just want to say hi? Email me: [email protected]
Follow me on Instagram: @jpimaths
Instagram: jpimaths
Don't forget to subscribe, it's *FREE*: @jpimaths
And, as always, any comments, feedback or suggestions are welcomed!
Thanks.
Hi,
In this video I'll be stating and proving Euler's handshaking lemma, all to do with graphs and graph theory. This lemma says that for any graph, the sum of the degrees of all vertices in a graph is equal to twice the number of edges in the graph. In particular, this tells us that the sum of the degrees of the graph must be even.
Want to send me a fun maths problem or theorem, or just want to say hi? Email me: [email protected]
Follow me on Instagram: @jpimaths
Instagram: jpimaths
Don't forget to subscribe, it's *FREE*: @jpimaths
And, as always, any comments, feedback or suggestions are welcomed!
Thanks.
3 سال پیش
در تاریخ 1400/04/24 منتشر شده
است.
3,505
بـار بازدید شده