Edges CutSet and Edges Connectivity

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/discrete-mathematics/graph-theory/cut-set-and-connectivity-edge-connectivity-vertex-connectivity-and-cut-set-concepts/asset-edges-cutset-and-edges-connectivity after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed explanation of 'Cut-Set' and 'Edge Connectivity' in graph theory. The instructor begins by defining a cut set as a minimal set of edges whose removal disconnects a connected graph. He uses a table and a labeled graph diagram to evaluate several sets of edges, marking them as valid or invalid based on the minimality condition. The lecture then transitions to define edge connectivity, denoted by $\lambda(G)$, as the size of the smallest cut set. Finally, the concept of a 'bridge' is introduced as a special case where edge connectivity is one.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the definition of a 'Cut Set' displayed on the slide: 'In a connected graph G, a cut set is a set of edges whose removal from g leaves G disconnected, provided removal of no proper subset of these edges disconnects G.' He emphasizes the minimality condition. He presents a table with a graph diagram on the right, containing vertices 1, 2, 3, 4 and edges labeled a through i. He analyzes the first set {a, f, g}, marking it as invalid (X) because removing a proper subset might also disconnect the graph. He then analyzes {a, e, h, c}, marking it as valid (check), explaining that removing these edges disconnects the graph and no smaller subset does. He moves to {a, i}, marking it invalid (X) because edge 'i' appears to be a bridge, making the set non-minimal.

  2. 2:00 – 5:00 02:00-05:00

    Continuing with the table, the instructor evaluates the set {e, h, f, g}. He marks it as valid (check) and circles the corresponding edges on the graph diagram to show how they partition the graph. Next, he analyzes {d, h, c, g}, marking it as invalid (X), reasoning that a subset of these edges is sufficient to disconnect the graph. He then evaluates {d, e, f}, marking it invalid (X) for similar reasons. Throughout this section, he repeatedly underlines the phrase 'provided removal of no proper subset of these edges disconnects G' on the slide to reinforce the core concept. He uses red ink to draw circles around the edges on the graph, visually demonstrating how the removal of specific sets partitions the vertices into disjoint sets.

  3. 5:00 – 7:16 05:00-07:16

    The lecture transitions to a new slide titled 'Connectivity'. The text defines edge connectivity: 'each cut-set of a connected graph G consist of a certain number of edges. The number of edges in the smallest cut-set is defined as the edges connectivity of G. It is denoted by $\lambda(G)$.' The instructor explains that this value represents the minimum number of edges that must be removed to disconnect the graph. He then introduces a specific case: 'if the edge connectivity from a graph is one, then that edge how's removal disconnect the graph is called a bridge.' He circles the word 'bridge' on the slide to highlight this special case. He elaborates that a bridge is a critical edge whose removal increases the number of connected components in the graph.

The video provides a comprehensive introduction to cut sets and edge connectivity in graph theory. It begins by rigorously defining a cut set, emphasizing the critical condition of minimality—that no proper subset of the edges can disconnect the graph. The instructor uses a detailed example with a labeled graph to evaluate various sets of edges, marking them as valid or invalid based on this definition. This practical application helps clarify the abstract definition. The lecture then broadens the scope to define edge connectivity, $\lambda(G)$, as the size of the smallest cut set. Finally, it introduces the concept of a bridge as a specific instance where edge connectivity is 1. This progression from specific examples to general definitions and finally to special cases provides a clear and logical understanding of how graph connectivity is measured and analyzed.

Loading lesson…