Spanning Tree

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/spanning-tree-and-spanning-forest-definition-construction-and-applications/asset-spanning-tree 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 comprehensive introduction to the concept of spanning trees in graph theory. The instructor begins by defining a spanning tree as a subgraph of a connected graph G that includes all vertices of G. He introduces the terminology of 'branches' for edges within the spanning tree and 'chords' for edges outside of it. Through visual examples, he demonstrates how to identify valid spanning trees versus subgraphs that contain cycles or are disconnected. The lecture concludes by establishing key algebraic properties, including formulas for rank and nullity, and their relationship to the total number of vertices and edges in the graph.

Chapters

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

    The lecture starts with four numbered definitions on the screen. The instructor explains that a spanning tree T must be a subgraph of G containing all vertices. He defines edges in T as 'branches' and edges not in T as 'chords'. He notes that these terms are relative to a specific spanning tree. He draws a complex graph G1 with vertices a, b, c, d, e, f. He then sketches three potential subgraphs labeled S1, S2, and S3. S1 is a triangle (cycle) involving vertices b, f, e. S2 is a star-like structure centered at b, missing vertices a and f. S3 is a path graph connecting all vertices. He marks S1 and S2 with red crosses to indicate they are not spanning trees, while S3 gets a red checkmark.

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

    The instructor transitions to a list of properties. He writes that for a connected graph with n vertices and e edges, a spanning tree has n-1 branches and e-n+1 chords. He states the condition for a graph to be a tree: adding an edge creates exactly one cycle. He introduces Rank (r) and Nullity (u). He writes the formulas: Rank(r) = n-1 and Nullity(u) = e - n + 1. He clarifies notation by writing |V| = n and |E| = e. He derives the number of chords by subtracting the edges in a tree (n-1) from the total edges (e), resulting in e - (n-1). He circles these formulas to emphasize their importance.

  3. 5:00 – 6:26 05:00-06:26

    The final section focuses on the relationship between rank, nullity, and total edges. The instructor highlights the formula 'Rank + nullity = number of edges in G'. He explains that the sum of branches (rank) and chords (nullity) equals the total number of edges (e). He uses the graph G1 to visually reinforce these concepts, pointing to the edges and vertices. He emphasizes that these properties are fundamental for analyzing connected graphs and their spanning trees, providing a complete toolkit for understanding graph connectivity and cycles.

The video systematically builds the concept of spanning trees from basic definitions to algebraic properties. It starts by defining the structural requirements (subgraph, all vertices) and terminology (branches, chords). Visual examples clarify what constitutes a valid spanning tree versus invalid subgraphs. The lesson culminates in establishing the mathematical relationships between graph parameters (n, e) and topological properties (rank, nullity). The final formula, Rank + Nullity = e, confirms that the total edges are partitioned into tree edges and chord edges, providing a complete toolkit for analyzing graph connectivity and cycles. This understanding is crucial for network analysis and algorithm design.

Loading lesson…