Bi-Partie Graph

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/graph-theory/bipartite-cycle-regular-and-complement-of-a-graph/asset-bi-partie-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 video lecture covers the definitions and properties of Bi-partite and Complete Bi-partite graphs. The instructor defines a Bi-partite graph as one where vertices are partitioned into two disjoint sets such that edges only connect vertices from different sets. He then defines a Complete Bi-partite graph where every vertex in one set connects to every vertex in the other, denoted as $K_{m,n}$. The lecture includes visual demonstrations and formula derivations for edge counts.

Chapters

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

    The instructor begins by defining a **Bi-partite graph**. He reads the formal definition from the slide: "A graph G(V, E) is called bi-partite graph if it's vertex set V(G) can be partitioned into two non-empty disjoint subset V1(G) and V2(G) in such a way that each edge e in E(G) has it's one end point in V1(g) and other end point in V2(g)." He emphasizes the condition that edges must connect vertices from different sets, not within the same set. He underlines key terms like "partitioned", "non-empty disjoint subset", and "one end point". He then illustrates this with a diagram, circling the left column of red vertices as set V1 and the right column of black vertices as set V2. He explains that the partition $V = V1 \cup V2$ is called the bipartition of G. He then introduces the second concept, **Complete Bi-partite graph**, reading the definition: "A Bi-partite graph G(V, E) is called Complete bi-partite graph if every vertex in the first partition is connected to every vertex in the second partition, denoted by $K_{m,n}$."

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

    The instructor elaborates on the **Complete Bi-partite graph** notation $K_{m,n}$. He writes $|V1| = m$ and $|V2| = n$ to represent the size of the two partitions. He explains that in a complete bipartite graph, the total number of edges is the product of the sizes of the two sets, writing $K_{m,n} = m imes n$. He draws a square graph with vertices labeled 1, 2, 3, 4 to demonstrate a bipartite structure, circling vertices 1 and 3 as one set and 2 and 4 as the other. He then draws a specific example of a complete bipartite graph with 3 vertices on the left and 3 on the right, labeling it $K_{3,3}$. He draws lines connecting every left vertex to every right vertex to show the "complete" nature. He also draws a graph with 4 vertices (1, 2, 3, 4) in a cycle, circling 1 and 3, and 2 and 4 to show it is bipartite. He emphasizes that for a graph to be bipartite, you must be able to divide vertices into two sets such that no two vertices within the same set are connected.

The lecture systematically builds the concept of bipartite graphs. It starts with the fundamental definition involving vertex partitioning and edge constraints. It then moves to the specific case of complete bipartite graphs, where connectivity is maximized between the two sets. The instructor uses visual aids, underlining text, and hand-drawn diagrams to reinforce the definitions. Key takeaways include the notation $K_{m,n}$, the condition for bipartition, and the formula for the number of edges in a complete bipartite graph ($m imes n$).

Loading lesson…