Hand-Shaking Theorem Part-1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/degree-of-vertex-isolated-and-pendant-vertices-handshaking-lemma-and-degree-sequence/asset-hand-shaking-theorem-part-1 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & 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
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. 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
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed explanation of the Hand-shaking theorem in graph theory. The instructor defines the theorem, which states that the sum of the degrees of all vertices in a graph is equal to twice the number of edges. He then derives a significant corollary: the number of vertices with odd degrees in any graph must always be an even number. The lesson is supported by a visual example featuring a graph with vertices labeled 'a' through 'j' and a corresponding table listing the degree of each vertex.

Chapters

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

    The video begins with the definition of the Hand-shaking theorem displayed on the screen: 'Since each edge contribute two degree in the graph, the sum of the degree of all vertices in G is twice the number of edges in g.' The instructor writes the mathematical formula $\sum_{i=1}^{n} d(vi) = 2|E|$ on the whiteboard area. He explains the logic that every edge connects two vertices, contributing 1 to each, totaling 2 per edge. He underlines the summation symbol and the term $2|E|$ to emphasize the equality. He then points to the graph diagram on the left and the 'Vertex | Degree' table on the right, preparing to verify the theorem with the specific data provided.

  2. 2:00 – 5:00 02:00-05:00

    The instructor introduces a new theorem: 'The number of vertices of odd degree in a graph is always even.' He writes the equation $\sum_{i=1}^{n} d(vi) = \sum_{even} d(vi) + \sum_{odd} d(vi)$ to break down the total sum. He explains that the total sum is even (from the Hand-shaking theorem) and the sum of even degrees is inherently even. Therefore, the sum of odd degrees must also be even, which is only possible if there is an even number of odd-degree vertices. To prove this, he circles the vertices with odd degrees in the table: 'a' (1), 'b' (1), 'c' (1), 'f' (1), 'g' (3), and 'h' (3). He counts these circled entries, confirming there are exactly 6 vertices of odd degree, which satisfies the theorem.

The lecture effectively connects the abstract theorem to a concrete example. By calculating the sum of degrees (1+1+1+4+4+1+3+3+2+2 = 22) and comparing it to twice the number of edges (11 edges * 2 = 22), the instructor validates the Hand-shaking theorem. The second part of the lecture logically deduces the parity of odd-degree vertices, a fundamental result in graph theory often used to prove the existence of Eulerian paths or cycles. The visual aids, including the red checkmarks and circles, help students track the specific vertices being discussed.

Loading lesson…