Degree of Vertices | Definition, Theorem & Example | Graph Theory

The degree of a vertex in Graph Theory is a simple notion with powerful consequences. Simply by counting the number of edges that leave from any vertex - the degree- we get theorems that make it impossible for a group of, say, 5 people to each shake the hands of exactly 3 people at a party. The parity (even vs odd) will be crucial.
**************************************************
Now it's your turn:
1) Summarize the big idea of this video in your own words
2) Write down anything you are unsure about to think about later
3) What questions for the future do you have? Where are we going with this content?
4) Can you come up with your own sample test problem on this material? Solve it!
Learning mathematics is best done by actually DOING mathematics. A video like this can only ever be a starting point. I might show you the basic ideas, definitions, formulas, and examples, but to truly master math means that you have to spend time - a lot of time! - sitting down and trying problems yourself, asking questions, and thinking about mathematics. So before you go on to the next video, pause and go THINK.
***************************************************
Want more ideas for learning math effectively?
►How to Watch Math Videos:
• How to watch math videos
►5 Tips to Make Math Practice Problems Effective: • 5 Tips To Make Math Pr...
****************************************************
►Want some cool math? Check out my "Cool Math" Series:
• Cool Math Series
****************************************************
Course Playlists:
►Calculus I: • Calculus I (Limits, De...
►Calculus II: • Older Calculus II (New...
►Discrete Math: • Discrete Math (Full Co...
►Linear Algebra: • Linear Algebra (Full C...
*****************************************************
►Follow me on Twitter: / treforbazett
*****************************************************
This video was created by Dr. Trefor Bazett, an Assistant Professor, Educator at the University of Cincinnati.
BECOME A MEMBER:
►Join: / @drtrefor
MATH BOOKS & MERCH I LOVE:
► My Amazon Affiliate Shop: www.amazon.com/shop/treforbazett

[@kishueatsfood]

Thanks this helped me a lot than what the other videos taught me!

[@continnum_radhe-radhe]

Amazing session sir 🔥🔥🔥

[@RamiDesigns]

thank you so much sir
help me a lot

[@user-vd8px2fo7w]

Nice series :)

[@pa6917]

Very nice session sir

[@kcol4411]

Amazing

[@ShahinaAkhter]

THANKS SIR

[@tushargoyaliit]

Awesome

[@naman4067]

Maximum No of connections possible in n number of vertices is n(n-1)/2

[@nednf5048]

king

[@akwiirenetapong9445]

Thankyou so much sir...youve saved my semester

[@laughoutmeow]

if there were 6 ppl then exactly 2 AND exactly 3 would then be viable?

[@Shannxy]

Yes, because the sum of the degrees would be even for both cases.
And if they all had 6 friends each, the graph would be considered a complete graph.