Euler Formula and its Version

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/discrete-mathematics/graph-theory/euler-formula-planar-graph-formula-applications-and-derived-relations/asset-euler-formula-and-its-version after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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 Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a lecture on deriving inequalities for connected planar graphs using Euler's formula. The instructor, Sanchit Jain, explains how to derive two specific inequalities: $e \le 3v - 6$ and $r \le 2v - 4$. He starts by listing four points on a slide, explaining the relationship between edges and faces ($2e \ge 3r$) and the definition of region degree. He then proceeds to algebraically derive the first inequality by substituting Euler's formula into the edge-face inequality.

Chapters

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

    The instructor begins by presenting a slide titled 'Other formula derived from Euler's formula'. He lists four key points. Point 1 states that connected planar graphs with more than one edge obey $2e \ge 3r$. He explains the logic: each face has at least three face-edge incidences, and each edge contributes exactly two incidences. Point 2 defines the degree of a region as the number of edges covering it, noting the sum of degrees equals $2|E|$. He then focuses on Point 3, which claims that eliminating $r$ from $r = e - v + 2$ and $3r \le 2e$ results in $e \le 3v - 6$. He starts the derivation on the board, writing $r = e - v + 2$ as equation (1) and $r \le rac{2}{3}e$ as equation (2). He substitutes (1) into (2) to get $ rac{2}{3}e \ge e - v + 2$. Multiplying by 3 gives $2e \ge 3e - 3v + 6$. Rearranging terms leads to $-e \ge -3v + 6$, and finally $e \le 3v - 6$, which he boxes.

  2. 2:00 – 4:06 02:00-04:06

    Next, the instructor derives the formula for Point 4. He writes Euler's formula $r = e - v + 2$ again. He rearranges it to solve for $e$, obtaining $e = r + v - 2$. He then uses the inequality $3r \le 2e$, which can be rewritten as $e \ge rac{3}{2}r$. Substituting the expression for $e$ into this inequality gives $r + v - 2 \ge rac{3}{2}r$. To clear the fraction, he multiplies the entire inequality by 2, resulting in $2r + 2v - 4 \ge 3r$. He subtracts $2r$ from both sides to get $2v - 4 \ge r$, or $r \le 2v - 4$. He boxes this final result and points to the corresponding line on the slide, completing the derivation of the second inequality.

The lecture provides a rigorous algebraic derivation of two critical inequalities for connected planar graphs. Starting with the basic property that $2e \ge 3r$ due to face-edge incidences, the instructor combines this with Euler's formula ($r = e - v + 2$). By substituting and rearranging terms, he first eliminates the variable $r$ to prove that the number of edges is bounded by $e \le 3v - 6$. Subsequently, he eliminates $e$ to prove that the number of regions is bounded by $r \le 2v - 4$. These steps are clearly written on the whiteboard, showing the transition from Euler's formula to these specific constraints, which are essential for determining if a graph is planar.

Loading lesson…