Proof: Tree Graphs Have at Least Two End Vertices | Graph Theory

Nontrivial tree graphs have at least two end vertices, sometimes called leaves, and we prove that graph theory result in today's video graph theory lesson!

Remember a tree is a connected acyclic graph, which means connected with no cycles. And end vertices are vertices of degree one - vertices with only a single neighbor.

Lesson on tree graphs:    • Intro to Tree Graphs | Trees in Graph...  

Eating Bugs:    • Eating BUGS and Proving the Pythagore...  



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+

◆ Support Wrath of Math on Patreon:   / wrathofmathlessons  

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

My Music Channel:    / seanemusic