Connected Graph
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- 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
- Paper 2 | DataBase Management System/DBMS: 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
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture covers fundamental properties of connected graphs in graph theory. The instructor presents four key theorems or conditions regarding connectivity. He begins by defining a connected graph and establishing the minimum number of edges required for connectivity. He then moves to a sufficient condition involving the number of edges relative to vertices, specifically the formula (n-1)(n-2)/2. Finally, he discusses the relationship between vertex degrees and connectivity, proving that two odd-degree vertices must be in the same component. Visual aids include handwritten notes, diagrams of graphs, and mathematical derivations on a digital whiteboard.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a slide listing four properties of connected graphs. The first point defines a connected graph: 'A graph is said to be connected if there is at least one path between pair of vertices in G.' The instructor writes deg(vi) >= 1 to discuss vertex degrees. He then draws a disconnected graph consisting of a square and a triangle to illustrate that even if every vertex has a degree of at least one, the graph itself might not be connected. He subsequently draws lines connecting the two shapes to demonstrate how adding edges creates a single connected component. This visual demonstration clarifies the distinction between local vertex properties and global graph connectivity. He emphasizes that connectivity is a property of the whole graph, not just individual vertices.
2:00 – 5:00 02:00-05:00
The lecture progresses to the third point on the slide, which states that a graph with n vertices is necessarily connected if it has more than (n-1)(n-2)/2 edges. The instructor writes |V| = 6 and |E| > 10 as a specific example. He derives the formula by considering a complete graph on n-1 vertices, which has (n-1)(n-2)/2 edges. He explains that a disconnected graph can have at most this many edges (a complete component of n-1 vertices and one isolated vertex). Therefore, exceeding this edge count forces the graph to be connected. He writes n -> n(n-1)/2 to show the total edges in a complete graph of n vertices, contrasting it with the disconnected case. He underlines the formula on the slide to emphasize its importance for exams.
5:00 – 6:22 05:00-06:22
In the final segment, the instructor addresses the fourth point regarding odd degree vertices. The slide states that if a graph has exactly two vertices of odd degree, there must be a path joining them. He draws a square with a diagonal and a separate triangle to visualize degrees. He circles a specific component to highlight vertices with odd degrees, explaining that odd degree vertices must exist in pairs within any connected component. This implies that if there are only two such vertices in the entire graph, they cannot be in separate components, as that would require at least two odd degree vertices per component. Thus, they must be connected. He underlines 'connected or disconnected' on the slide to show the condition applies generally.
The video provides a structured lesson on graph connectivity, moving from definitions to specific theorems. The instructor uses a combination of slide text and handwritten derivations to explain complex concepts. Key takeaways include the minimum edge requirement for connectivity, the threshold for guaranteed connectivity based on edge density, and the relationship between vertex degrees and component structure. The visual examples of disconnected and connected graphs help solidify the theoretical definitions. The progression from basic definitions to more advanced theorems ensures a comprehensive understanding of the topic for students preparing for exams. The instructor's use of specific numerical examples like |V|=6 helps students apply the formulas to concrete problems.

