Euler Formula

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/unit-i-discrete-mathematical-structure/graph-theory/euler-formula-planar-graph-formula-applications-and-derived-relations/asset-euler-formula after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a detailed analysis of Euler's formula within the context of planar graphs. The instructor begins by defining a planar graph as one that divides the plane into a number of regions, often called faces or planar embeddings. These regions are categorized into bounded internal regions and the single unbounded external region. He presents the standard Euler's formula for finite, connected planar graphs: $r = e - v + 2$, where $r$ is the number of faces, $e$ is the number of edges, and $v$ is the number of vertices. He notes that this formula can be rigorously proved using mathematical induction. To illustrate the concept, he draws a square with a diagonal line, labeling the vertices $a, b, c, d$. He identifies three distinct regions: two internal triangular regions ($r_1, r_2$) and one external region ($r_3$). He verifies the formula by counting 5 edges and 4 vertices, calculating $5 - 4 + 2 = 3$, which correctly matches the number of regions. He highlights the formula $r = e - v + 2$ on the screen.

Chapters

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

    The lecture begins by defining a planar graph as a graph that divides the plane into regions or faces. The instructor distinguishes between bounded internal regions and the unbounded external region. He presents Euler's formula for finite, connected planar graphs: $r = e - v + 2$. He mentions the proof method is mathematical induction. He draws a square with a diagonal to create a visual example. He labels vertices $a, b, c, d$ and identifies regions $r_1, r_2$ (internal) and $r_3$ (external). He counts 5 edges and 4 vertices, calculating $5 - 4 + 2 = 3$, which matches the number of regions. He highlights the formula $r = e - v + 2$ on the screen.

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

    The instructor transitions to the case of disconnected graphs. He writes the formula $V - e + r - k = 1$ on the board, circling it for emphasis. He explains that $k$ likely represents the number of connected components. He draws a triangle with vertices $e, f, g$ as a potential example, though the specific numbers written ($7 - 8 + 4 - 2 = 1$) suggest a more complex disconnected graph example is being discussed or calculated, possibly involving multiple components. He underlines the statement that the formula can be proved by mathematical induction. The focus shifts to handling graphs that are not connected, introducing the variable $k$ to adjust the standard formula. He writes $7 - 8 + 4 - 2 = 1$ to demonstrate the calculation for a specific disconnected case.

The lesson progresses from the fundamental definition of planar graphs and their regions to the application of Euler's formula. It starts with the connected case ($r = e - v + 2$), using a square with a diagonal to demonstrate the counting of vertices, edges, and faces. The lecture then extends this concept to disconnected graphs, introducing a modified formula ($V - e + r - k = 1$) that accounts for the number of connected components ($k$). This progression highlights the versatility of Euler's formula in graph theory, covering both simple connected structures and more complex disconnected systems. The instructor emphasizes the importance of identifying the external region and the number of components to apply the correct formula.

Loading lesson…