Edge cuts, minimum edge cuts, minimal edge cuts, and edge connectivity are all introduced in today's graph theory lesson!
Edge cuts are similar to vertex cuts but, of course, with edges! An edge cut of a nontrivial graph G is a set, X, of edges of G, such that G-X is disconnected. The cardinality of a minimum edge cut in a graph is called the edge-connectivity of the graph, denoted lambda(G). A minimal edge cut is an edge cut with no other edge cuts as a proper subset.
Lesson on vertex cuts: [ Ссылка ]
Lesson on bridges: [ Ссылка ]
A proof relating bridges to cycles: [ Ссылка ]
◆ Donate on PayPal: [ Ссылка ]
◆ Support Wrath of Math on Patreon: [ Ссылка ]
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: [ Ссылка ]
Vallow Spotify: [ Ссылка ]
Vallow SoundCloud: [ Ссылка ]
********************************************************************
+WRATH OF MATH+
Follow Wrath of Math on...
● Instagram: [ Ссылка ]
● Facebook: [ Ссылка ]
● Twitter: [ Ссылка ]
My Music Channel: [ Ссылка ]
