Cycle, Wheel & Regular Graph

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/bipartite-cycle-regular-and-complement-of-a-graph/asset-cycle-wheel-regular-graph 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 introduction to specific types of graphs in graph theory, focusing on Cycle Graphs, Wheel Graphs, and Regular Graphs. The instructor explains the structural definitions, mathematical properties such as vertex and edge counts, and degree constraints. Visual aids are used extensively to illustrate the progression of these graphs as the number of vertices increases, clarifying notation differences and identifying key characteristics for exam preparation. The lecture moves from specific shapes to general connectivity rules.

Chapters

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

    The session begins with definitions for Cycle Graphs and Wheel Graphs. The slide text defines a Cycle Graph ($C_n$) as a graph consisting of a single cycle with $n$ vertices ($n \ge 3$), where the number of vertices equals the number of edges, and every vertex has a degree of 2. A Wheel Graph is defined as a graph formed by connecting a single universal vertex to all vertices of a cycle. The instructor underlines key terms like 'closed chain' and 'degree 2'. He highlights a notation ambiguity: some authors use $W_n$ for $n$ vertices ($n \ge 4$), while others use it for $n+1$ vertices ($n \ge 3$). Diagrams show $C_3$ to $C_6$ and $W_4$ to $W_9$. A red checkmark appears under $C_4$.

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

    The topic shifts to Regular Graphs. The definition states that a graph is regular if all vertices are of equal degree. Examples given include 2-regular and 3-regular graphs. The instructor uses red circles to highlight vertices in a series of diagrams, demonstrating that in these graphs, every vertex connects to the same number of edges. He writes '5-regular graph' next to a dense graph diagram, indicating a specific case where every vertex has a degree of 5. This section emphasizes the uniformity of connectivity as the defining feature. The diagrams feature red dots for vertices and lines for edges.

The lecture systematically builds understanding from specific graph topologies to general classification rules. By first establishing the rigid structure of cycles and wheels, the instructor sets the stage for defining regular graphs, where the primary criterion is the uniformity of vertex degrees. This progression helps students distinguish between graphs defined by their shape (cycles/wheels) versus those defined by their connectivity properties (regularity). The visual emphasis on vertex degrees reinforces the core concept of regularity.

Loading lesson…