Basic Terminology of Graph
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- 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
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
- General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
- English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
- Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
- Full Mock Test:
- Previous Year Papers:
- GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces the foundational terminology of Graph Theory, beginning with the formal definition of a graph G(V, E) as a set of vertices and edges. The instructor establishes that each edge is an unordered pair of vertices, known as end vertices. Visual aids featuring nodes labeled A through G illustrate these abstract concepts. The lesson progresses to define specific edge types, including self-loops and parallel edges, using handwritten annotations like (B,C) to demonstrate the unordered nature of pairs. Subsequent segments classify graphs into Simple Graphs, which lack self-loops and parallel edges, and Multi/Pseudo Graphs, which permit them. Key definitions for adjacent vertices and adjacent edges are also presented alongside diagrams to clarify incidence relationships.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with the formal definition of a graph G(V, E), displayed on screen as consisting of two sets: vertices V and edges E. The instructor explains that an edge ek is identified with an unordered pair (vi, vj) of vertices. Visual evidence includes a slide listing '1. A graph G (V, E) consist of a set off objects V = {V1, V2, V3,...,VN} called vertices' and '2. Each edge ek is identified with an unordered pair (vi, vj) of vertices.' A diagram showing nodes labeled A through G is used to visualize the structure, while the instructor underlines key terms like 'vertices' and 'edges' to emphasize their roles as fundamental components.
2:00 – 5:00 02:00-05:00
The instructor transitions to defining specific edge types and relationships. Handwritten annotations (B,C) and (C,B) appear to illustrate that edges are unordered pairs. The screen displays definitions for 'Self-Loop: Edge having the same vertex (vi, vi) as both its end vertices' and 'Parallel Edge: When more than one edge associated with a given pair of vertices.' The lesson further defines 'Adjacent Vertices' as those joined by the same edges and 'Adjacent Edges' as those incident on a vertex. Diagrams accompany these text definitions, with the instructor underlining phrases like 'same vertex' and 'more than one edge' to highlight critical conditions for classification.
5:00 – 6:14 05:00-06:14
The final segment classifies graphs based on the presence of self-loops and parallel edges. A table is displayed comparing 'Simple Graph' against 'Multi/Pseudo Graph'. The text indicates that a Simple Graph contains no self-loops and no parallel edges, whereas a Multi/Pseudo Graph allows both. The instructor underlines 'Simple Graph' and its properties to distinguish it from the alternative classification. This section synthesizes previous definitions into a structural taxonomy, using visual cues to reinforce that the absence of loops and parallel edges is the defining characteristic of a simple graph.
The video systematically builds the vocabulary of Graph Theory, moving from abstract definitions to concrete classifications. It begins by establishing that a graph is composed of vertices and edges, where an edge represents an unordered connection between two end vertices. The instructor uses specific examples like (B,C) to clarify that order does not matter in undirected edges. The lecture then introduces exceptions and variations, defining self-loops where an edge connects a vertex to itself and parallel edges where multiple connections exist between the same pair of vertices. Finally, these concepts are organized into a classification system: Simple Graphs exclude both self-loops and parallel edges, while Multi/Pseudo Graphs include them. This progression ensures students understand not just what a graph is, but how variations in edge structure define different types of graphs.

