Null Graph Vs Trivial Graph

Duration: 3 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-null-graph-vs-trivial-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 segment, presented by Anchit Jain from LedgerGate Educator, focuses on defining specific types of graphs in graph theory. The primary concepts covered are the 'Null Graph' and the 'Trivial Graph.' The instructor relies heavily on on-screen text definitions and hand-drawn diagrams to explain these abstract concepts. He begins by establishing the criteria for a Null Graph, emphasizing the emptiness of the edge set. He then contrasts this with the Trivial Graph, which represents the minimal case of a graph. The visual presentation includes labeled vertices, mathematical notation for sets, and specific annotations to guide student understanding of these foundational definitions.

Chapters

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

    The instructor defines a Null Graph. The on-screen text states: 'A graph is said to be null if edge set is empty E = {}, that is a graph with only vertices but no edges.' He draws a diagram labeled G1 with three points 'a', 'b', and 'c'. He circles each vertex in red to show presence without connections. He writes 'null graph' in red ink. Crucially, he underlines 'edge set is empty E = {}' in the text to stress that the absence of edges is the defining feature of this graph type.

  2. 2:00 – 2:42 02:00-02:42

    Next, the instructor introduces the Trivial Graph. The text defines it as 'A graph with only one vertex without an edge is called trivial graph. It is the smallest possible.' He draws a single point labeled 'a' and circles it in red. He writes 'null -> trivial' to indicate a conceptual link. He labels this diagram G2. He underlines 'Trivial Graph' and 'smallest possible' in the text. He briefly writes 'G2' and crosses it out. This section emphasizes that a single isolated vertex is the most basic form of a graph.

The lecture effectively differentiates between Null and Trivial graphs by focusing on vertex and edge counts. A Null Graph is shown to have multiple vertices but zero edges, while a Trivial Graph is defined by having exactly one vertex and zero edges. The instructor uses consistent visual cues, such as red circles for vertices and underlining for key definitions, to reinforce the material. This progression helps students understand that while both lack edges, the Trivial Graph is a specific, minimal subset of the Null Graph concept, representing the absolute smallest graph possible in graph theory.

Loading lesson…