What is a Cut Vertex? | Graph Theory, Cut Vertices, Articulation Points, Components
What is a cut vertex? Cut vertices, sometimes called articulation points, are the subject of today’s graph theory video lesson!
A vertex, v, of a graph, G, is a cut vertex if G - v has more components than G. Equivalently, if removing v from G disconnects the component containing v, then v is a cut vertex. It "cuts" the graph so to speak, hence its name.
Considering graphs as a network, a cut vertex can be considered a vulnerability in the network (this wording is from GeeksforGeeks.org) because deleting that vertex disconnects the network.
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
