Graph with Minimum Degree at Least 2 Has a Cycle | Graph Theory

Описание: Any graph with minimum degree at least 2 must have a cycle! We'll consider a longest path to prove this basic graph theory result in today's lesson. This means, of course, that no tree graph can have a minimum degree of 2 or more, and thus every nontrivial tree graph has an end vertex. In fact, every tree graph has at least two end vertices (vertices of degree 1). Remember that trees are connected graphs with no cycles!

Proof that tree graphs have at least two end vertices:    • Proof: Tree Graphs Have at Least Two End V...  

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

I hope you find this video helpful, and be sure to ask any questions down in the comments!

********************************************************************
The outro music is by a favorite musician of mine named Vallow, who, upon my request, kindly gave me permission to use his music in my outros. I usually put my own music in the outros, but I love Vallow's music, and wanted to share it with those of you watching. Please check out all of his wonderful work.

Vallow Bandcamp: https://vallow.bandcamp.com/
Vallow Spotify: https://open.spotify.com/artist/0fRtu...
Vallow SoundCloud:   / benwatts-3  
********************************************************************

+WRATH OF MATH+

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

My Music Channel:    / seanemusic