Planner Graph
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.
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.

