Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.
The lecture discusses vertex connectivity and edge connectivity within graph theory, explaining how vertex cuts and edge cuts relate to the disconnection of a graph. It introduces the definitions of vertex connectivity, edge connectivity, and their respective measures, as well as the relationship between them. Special cases such as complete graphs are explored, establishing key insights into how these connectivity measures operate in various structures.
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
References
ch49.pdfClass Notes
Memorization
What we have learnt
Final Test
Revision Tests
Term: Vertex Cut
Definition: A proper subset of vertices whose removal disconnects the graph.
Term: Edge Cut
Definition: A set of edges whose removal disconnects the graph.
Term: Vertex Connectivity (κ)
Definition: The size of the smallest vertex cut in a graph, reflecting the minimum number of vertices needed to disconnect it.
Term: Edge Connectivity (λ)
Definition: The size of the smallest edge cut in a graph, indicating the minimum number of edges required to disconnect it.
Term: kConnected Graph
Definition: A graph is k-connected if the vertex connectivity of the graph is at least k.