Degree of Vertex, Isolated & Pendant Vertex

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/discrete-mathematics/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. 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.

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…