Minimum vertex covering

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/graph-covering-line-and-vertex-covering-independent-set-and-minimalmaximal-variants/asset-minimum-vertex-covering after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. 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
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a foundational lesson on graph theory, specifically focusing on the concept of 'Vertex Covering.' The instructor begins by stating the formal definition: a subset K of vertices V is a vertex cover if every edge in the graph is incident to at least one vertex in K. He uses a visual example of a graph with four vertices labeled a, b, c, and d, connected by edges including a diagonal. He systematically evaluates different subsets of vertices to determine if they satisfy the covering condition. The lecture then advances to differentiate between minimal and minimum covers, introducing standard notation for the size of the optimal solution.

Chapters

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

    In the first segment, the instructor defines 'Vertex Covering' using the on-screen text: 'Let G (V, E) be graph, a subset K of V is called a vertex covering of G if every edge of G is incident with a vertex in K.' He presents a graph with vertices a, b, c, d and lists three subsets: K1 = {b, d}, K2 = {a, b, c}, and K3 = {b, c, d}. He places blue checkmarks next to these sets, confirming they are valid vertex covers because every edge touches at least one vertex in the set. He then writes K4 = {a, c} and marks it with a cross, explaining that it fails because the edge connecting d and b is not incident to either a or c.

  2. 2:00 – 3:02 02:00-03:02

    The lecture transitions to 'Minimal vertex cover' and 'Minimum vertex covering'. The text defines a minimal cover as one where 'no vertex can be deleted from K, without violating the condition.' A minimum vertex covering is defined as the cover with the 'minimum number of vertices.' The instructor introduces the notation alpha_2 (α2) for the 'vertex Covering no of graph G.' He circles vertices on the diagram to visualize coverage. Finally, he writes 'alpha_2 (G) = 2' on the board, indicating that the smallest possible vertex cover for this specific graph contains two vertices, likely referring back to K1.

The lesson progresses from a general definition to specific optimization concepts. Initially, the focus is on identifying any valid set of vertices that touches all edges. The instructor demonstrates that multiple valid covers exist, ranging from size 2 to size 3. The second part of the lecture refines this by distinguishing between 'minimal' (cannot remove a vertex) and 'minimum' (smallest possible size). This distinction is crucial for algorithmic problems where the goal is to find the most efficient cover, denoted by the parameter alpha_2.

Loading lesson…