Vertex Connectivity of the Petersen Graph | Graph Theory

What is the vertex connectivity of the Petersen graph? We'll go over the connectivity of this famous graph in today's graph theory video lesson.

The vertex connectivity of the Petersen graph is 3. This means a minimum of 3 vertices can be deleted to disconnect it. We'll show this is true by showing that 3 vertices is enough, and then showing that fewer than 3 vertices is not enough. Thus, 3 vertices is the necessary and sufficient amount to delete in order to disconnect the Petersen graph. Our discussion includes vertex transitivity and isomorphisms.

Vertex Connectivity of a Graph:    • Vertex Connectivity of a Graph | Conn...  
What are Isomorphic Graphs:    • What are Isomorphic Graphs? | Graph I...  

★DONATE★
◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits:   / wrathofmathlessons  
◆ Donate on PayPal: https://www.paypal.me/wrathofmath

Thanks to Robert Rennie and Barbara Sharrock for their generous support on Patreon!

Thanks to Crayon Angel, my favorite musician in the world, who upon my request gave me permission to use his music in my math lessons: https://crayonangel.bandcamp.com/

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

My Music Channel:    / @emery3050