28. Vertex and Edge Connectivity
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.
Sections
Navigate through the learning materials and practice exercises.
What we have learnt
- Vertex cuts disconnect a graph by removing a subset of vertices.
- Edge cuts disconnect a graph by removing a subset of edges.
- Vertex connectivity is always less than or equal to edge connectivity for connected, non-complete graphs.
Key Concepts
- -- Vertex Cut
- A proper subset of vertices whose removal disconnects the graph.
- -- Edge Cut
- A set of edges whose removal disconnects the graph.
- -- Vertex Connectivity (κ)
- The size of the smallest vertex cut in a graph, reflecting the minimum number of vertices needed to disconnect it.
- -- Edge Connectivity (λ)
- The size of the smallest edge cut in a graph, indicating the minimum number of edges required to disconnect it.
- -- kConnected Graph
- A graph is k-connected if the vertex connectivity of the graph is at least k.
Additional Learning Materials
Supplementary resources to enhance your learning experience.