Degree of Vertex, Isolated & Pendant Vertex

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-discrete-structures-and-theory-of-logic/graph-theory/degree-of-vertex-isolated-and-pendant-vertices-handshaking-lemma-and-degree-sequence/asset-degree-of-vertex-isolated-pendant-vertex after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: 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, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed introduction to graph theory concepts, specifically focusing on the Degree of a Vertex and the Hand-shaking theorem. The instructor begins by defining the degree of a vertex in an undirected graph as the count of edges connected to that specific vertex. He uses a visual example with vertices labeled 'a' through 'j' to demonstrate the calculation process. The lecture further classifies vertices based on their degrees, introducing terms like isolated vertex and pendant vertex. Finally, the session culminates in the Hand-shaking theorem, which establishes a mathematical relationship between the sum of all vertex degrees and the total number of edges in the graph.

Chapters

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

    The instructor introduces the core definition: Degree of a Vertex: The degree of a vertex in an undirected graph is the number of edges associated with it, denoted by deg(vi). He underlines key phrases on the slide to emphasize the definition. He then analyzes a specific graph diagram containing vertices 'a' through 'j'. A table is displayed next to the graph, listing the calculated degree for each vertex (e.g., vertex 'd' has a degree of 4, vertex 'e' has a degree of 4). He circles vertices 'a', 'b', and 'c' to identify them as having a degree of 1. He also writes deg(k) = 0 to explain the concept of an isolated vertex, which has no edges. The slide explicitly defines a Pendant vertex as a vertex with degree one.

  2. 2:00 – 3:40 02:00-03:40

    The lecture transitions to the Hand-shaking theorem. The slide text states: 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 explains that because every edge connects two vertices, it contributes exactly two to the total degree sum. The mathematical formula sum(d(vi)) = 2|E| is shown on the screen. This theorem provides a method to verify the consistency of a graph's structure. The instructor likely uses the previous example graph to demonstrate that the sum of the degrees equals twice the number of edges, confirming the theorem.

The video builds a coherent understanding of graph connectivity. It starts with the local property of a single vertex (degree), moves to classifying specific types of vertices (pendant, isolated), and concludes with a global property (Hand-shaking theorem). This progression allows students to understand how local connections sum up to define the entire graph's structure. The visual aids, including the graph diagram and the degree table, are crucial for reinforcing the abstract definitions with concrete examples. The theorem serves as a fundamental check for graph validity.

Loading lesson…