Planner Graph
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- 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
- 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
- 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
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video introduces planar graphs, defined as graphs drawable on a plane without edge crossings. The instructor uses a square with diagonals (K4) to show how a non-planar drawing can be transformed into a planar one. The lesson identifies K5 and K3,3 as fundamental non-planar graphs. Through visual demonstrations and mathematical derivations, the instructor proves their non-planarity using edge-vertex inequalities derived from Euler's formula. The lecture connects theoretical definitions with practical applications in engineering and circuit design.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a clear definition displayed on the screen: "Planer Graph: - A graph is called a planer graph if it can be drawn on a plan in such a way that no edges cross each other, otherwise it is called non-planer." The instructor highlights applications in civil engineering and circuit designing. He draws a square with vertices labeled a, b, c, and d, including both diagonals, which creates a crossing point in the center. He explains that while this drawing has crossings, the graph itself is planar. To prove this, he redraws the graph in red, keeping the outer square and one diagonal, but moving the other diagonal outside the square to avoid intersection. This visual transformation effectively demonstrates the core concept that planarity depends on the existence of a crossing-free drawing, not just any specific drawing. The labels a, b, c, and d are clearly visible at the corners of the square.
2:00 – 5:00 02:00-05:00
The instructor shifts focus to non-planar graphs, introducing the complete graph K5. He draws a pentagon with all diagonals connected, forming a star inside, and labels it "K5". He attempts to redraw this graph to eliminate crossings but shows that it is impossible, marking it with a red cross. Next, he introduces the complete bipartite graph K3,3. He draws a complex graph with six vertices and nine edges, attempting to rearrange the edges to avoid intersections. He writes down the vertex and edge counts for these graphs: for K5, he writes "5" for vertices and "10" for edges; for K3,3, he writes "6" for vertices and "9" for edges. These visual aids serve as the basis for the mathematical proofs that follow, establishing K5 and K3,3 as the minimal non-planar graphs. The red drawings show the instructor's struggle to find a planar embedding.
5:00 – 7:15 05:00-07:15
In the final segment, the instructor formalizes the non-planarity of K5 and K3,3 using mathematical inequalities. He writes the condition for a simple planar graph: E <= 3V - 6. He applies this to K5, substituting V=5 and E=10, resulting in the inequality 10 <= 9, which is false, thus proving K5 is non-planar. He then notes that for K3,3, the inequality 9 <= 12 holds true, so this condition alone is insufficient. He introduces a stricter condition for bipartite graphs: E <= 2V - 4. Applying this to K3,3 (V=6, E=9), he derives 9 <= 8, which is false. This mathematical proof confirms K3,3 is non-planar. The instructor concludes by summarizing that these two graphs are the fundamental obstructions to planarity. He also writes "min" under the inequalities to indicate minimum conditions.
The lecture effectively bridges the gap between visual intuition and mathematical rigor in graph theory. By starting with a simple definition and a tangible example of K4, the instructor makes the abstract concept of planarity accessible. The progression to K5 and K3,3 introduces the concept of forbidden minors. The final mathematical proofs provide the necessary tools for students to verify planarity without drawing, using edge and vertex counts. This structured approach ensures a deep understanding of why certain graphs are inherently non-planar.

