Isomorphism ShortCut Trick

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/unit-i-discrete-mathematical-structure/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. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK / राज्यवार सामान्य ज्ञान (GK)
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs / GK- समसामयिकी
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce
  18. Paper 2 | Full Length Mock Tests:
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…