Edges CutSet and Edges Connectivity
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- Paper 2 | 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 Run Time Environment
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
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
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: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.
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.

