2.9.4 k-Connectivity: Video

[@madhevancharu9200]

What is meant by triple connected

[@muhammadmujtabanawaz111]

Thank you Professor

[@Samin7575]

thank you it was brief and clear.... what is well-linked and x-well-linked graph?

[@anumsheraz4625]

Why do I think that the definition at the start (0:13) is slightly wrong. Shouldn't it be "Vertices v and w are k-edge connected if they GET DISCONNECTED whenever fewer than k edges are deleted" ? Please correct me :)

[@nomi98]

No. They get disconnected whenever more than k edges are cut.

[@nomi98]

If less than k are cut, it is still connected. Rather obviously.

[@khaledsakkaamini4743]

very clear explanation thanks

[@aldrintaylor948]

Great video!

[@ezasuddy4558]

Thank you for this, really helped me.

[@ayanaxhye]

awesome