Discrete Mathematics - Vol 2 | 28. Vertex and Edge Connectivity by Abraham | Learn Smarter
K12 Students

Academics

AI-Powered learning for Grades 8–12, aligned with major Indian and international curricula.

Professionals

Professional Courses

Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.

Games

Interactive Games

Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.

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

  • 28.1

    Discrete Mathematics

    This section discusses vertex connectivity, edge connectivity, vertex cuts, and edge cuts in graphs.

  • 28.1.1

    Vertex And Edge Connectivity

    This section discusses the definitions of vertex and edge connectivity in graphs, including vertex cuts, edge cuts, and their relationships.

  • 28.1.2

    Definition Of A Vertex Cut

    A vertex cut in graph theory refers to a proper subset of vertices whose removal disconnects the graph.

  • 28.1.3

    Vertex Connectivity Of A Graph

    This section explores vertex connectivity in graphs, defining key concepts such as vertex cuts, connectivity, and their relationships with edge connectivity.

  • 28.1.4

    Edge Cut

    The section discusses edge cuts and edge connectivity in graphs, defining key concepts and their importance in graph theory.

  • 28.1.5

    Edge Connectivity Of A Graph

    This section discusses the concepts of vertex and edge connectivity in graphs, defining key terms, providing examples, and explaining their significance.

  • 28.1.6

    Upper Bounds On Vertex Connectivity And Edge Connectivity

    This section discusses vertex cuts, vertex connectivity, edge cuts, and edge connectivity, establishing their definitions and their relationships, specifically for connected, non-complete graphs.

  • 28.1.7

    Relationship Between Vertex Connectivity And Edge Connectivity

    This section defines vertex and edge connectivity in graphs and proves their interrelationship, showcasing how they are influenced by the graph's structure.

  • 28.1.8

    Conclusion

    This conclusion summarizes the concepts of vertex and edge connectivity, highlighting their definitions, properties, and relationships.

References

ch49.pdf

Class Notes

Memorization

What we have learnt

  • Vertex cuts disconnect a gr...
  • Edge cuts disconnect a grap...
  • Vertex connectivity is alwa...

Final Test

Revision Tests