Complement Of a Graph

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/discrete-mathematics/graph-theory/bipartite-cycle-regular-and-complement-of-a-graph/asset-complement-of-a-graph after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a comprehensive definition of the complement of a simple graph G(V, E). The instructor explains that the complement graph Gc(V, Ec) shares the exact same vertex set as the original graph. The fundamental property is that an edge exists between any two vertices u and v in the complement if and only if there is no edge between them in the original graph. The lecture transitions into formal set-theoretic definitions and formulas involving the complete graph Kn.

Chapters

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

    The lecture begins by displaying a slide titled Complement of a Graph with four numbered points. Point 1 defines the complement Gc on the same vertices as G, emphasizing the condition that adjacency in Gc implies non-adjacency in G. The speaker underlines the phrase no edge between u, v in G to stress the inverse relationship. Point 2 states V(G) = V(Gc). Point 3 defines the edge set using set builder notation: E(Gc) = {(u, v) | (u, v) not in E(G)}. Point 4 presents the formula E(Gc) = E(Kn) - E(G). Below the text, diagrams labeled I and II show two graphs that sum to a complete graph, visually illustrating the concept.

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

    The instructor writes on the slide to clarify the concepts. He draws a box around the set theory analogy Ac = U - A to show how it applies to graphs. He writes G U Gc = Kn and G intersection Gc = null, indicating that the union of a graph and its complement is the complete graph, while their intersection is empty. He also writes K - G = Gc to summarize the edge relationship. He then moves to the bottom of the slide, drawing a 5-cycle graph (pentagon) and its complement (a star shape), demonstrating that their combination results in a complete graph K5.

The video effectively bridges the gap between verbal definitions and mathematical formalism in graph theory. By establishing that the complement operation is essentially subtracting the edges of G from the edges of the complete graph Kn, the instructor provides a clear computational method. The visual examples, particularly the pentagon and its complement, serve as a concrete application of the abstract formulas G U Gc = Kn and E(Gc) = E(Kn) - E(G), ensuring students understand that every missing edge in the original graph becomes a present edge in the complement. This progression from definition to formula to visual proof solidifies the concept of graph complements.

Loading lesson…