Isomorphism ShortCut Trick

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-discrete-structures-and-theory-of-logic/graph-theory/graph-isomorphism-definition-detection-and-problem-solving/asset-isomorphism-shortcut-trick after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. Computer Networks: 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 Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Sanchit Jain Sir of Knowledge Gate Educator, focuses on graph isomorphism. The visual aid is a slide titled "How to check whether two graphs are isomorphic or not," listing 12 criteria. The instructor walks through the list, verbally confirming each point and visually marking it with a red checkmark or line to indicate validity. The lecture serves as a revision guide for students in discrete mathematics or graph theory, covering essential properties.

Chapters

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

    The session begins with the instructor introducing the topic. He starts with the most fundamental invariants: Point 1 "Number of vertices" and Point 2 "Number of edges," marking both with red checks. He moves to Point 3, "Number of vertices with a given degree," and Point 4, "Check degree property of vertices with their neighbor," emphasizing that the neighbors of a vertex must also have compatible degrees. He then discusses Point 5, which involves checking "minimum cycle length, maximum cycle length, or number of cycle with a specific length." He also covers Point 6, "Can check isomorphism for complement of the graph." Towards the end of this window, he briefly marks Point 7 "Planer, non-planer" and Point 8 "Connected disconnected" as additional properties to consider.

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

    The instructor continues with the remaining advanced properties. He marks Point 9 "Chromatic number," indicating that isomorphic graphs must have the same chromatic number. He proceeds to Point 10, "Matching number, covering number," and Point 11, "Edge connectivity, vertex connectivity." The final point, Point 12, offers a procedural approach: "If it seems that graphs are isomorphic to each other then identify the similar vertex and delete both, and keep repeating the process until we are sure." He marks this final point, concluding the list of 12 checks.

The video structures graph isomorphism verification from simple numerical invariants to complex structural properties. By marking each point, the instructor reinforces standard checks in graph theory. The final point introduces a recursive strategy: if invariants match, one can construct an isomorphism by iteratively removing matched vertices. This list serves as a robust toolkit for students to determine if two graphs share structural properties.

Loading lesson…