Complete Graph

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/types-of-graphs-finite-infinite-null-trivial-complete/asset-complete-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.

The lecture introduces the concept of a Complete or Full Graph, denoted as $K_n$. The instructor defines it as a simple graph where an edge exists between every pair of vertices, meaning every vertex is adjacent to all others. Visual examples ranging from $K_2$ to $K_7$ are displayed to illustrate increasing complexity. The lesson then shifts to the mathematical properties, specifically deriving the formula for the number of edges in a complete graph, which is $n(n-1)/2$. The instructor demonstrates this formula using the $K_4$ graph, calculating the total edges to be 6.

Chapters

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

    The instructor begins by defining a Complete or Full Graph using on-screen text that states a simple graph is complete if an edge exists between each and every pair of vertices. He underlines key phrases like edge between each and every pair of vertices and every vertex are adjacent to each other to emphasize the definition. The slide displays a series of diagrams labeled $K_2, K_3, K_4, K_5, K_6, K_7$, showing graphs with 2, 3, 4, 5, 6, and 7 vertices respectively. For the $K_4$ example, he manually writes numbers 1, 2, 3, and 4 on the vertices to demonstrate that every numbered vertex connects to every other numbered vertex. He circles the notation $K_n$ to indicate the general notation for a complete graph with $n$ vertices.

  2. 2:00 – 4:51 02:00-04:51

    The slide updates to list two key properties: a simple graph with the maximum number of edges is a Complete Graph, and the number of edges is given by the formula $n(n-1)/2$. The instructor derives this formula by explaining that each of the $n$ vertices connects to $n-1$ other vertices. He writes the equation $(n-1) imes n = rac{n(n-1)}{2}$ on the screen in red ink. To verify the formula, he applies it to the $K_4$ graph shown earlier, substituting $n=4$ into the equation to get $ rac{4(4-1)}{2} = rac{12}{2} = 6$. He counts the edges on the $K_4$ diagram (4 outer edges plus 2 diagonals) to confirm the result is 6. He concludes by writing $|V| = n$ and $|E| = rac{n(n-1)}{2}$ to summarize the vertex and edge counts.

The video provides a comprehensive introduction to complete graphs, moving from a qualitative definition to a quantitative formula. The core concept is that in a complete graph, no two vertices are non-adjacent. This structural property leads directly to the edge formula, which calculates the total number of unique pairs of vertices. The instructor effectively bridges the gap between the visual representation of fully connected nodes and the algebraic calculation of edges, ensuring students understand both the geometric structure and the combinatorial logic behind the $n(n-1)/2$ formula.

Loading lesson…