Graph Theory Example 1.019 GATE CS 2003 Perfect Matching

preview_player
Показать описание
Graph Theory problem asked in GATE CS 2003 (Perfect Matching)
  1. Harshit Pande
  2. GATE CS
  3. Computer Science
  4. Discrete Mathematics
  5. Graph Theory
  6. Perfect Matching
Рекомендации по теме
Graph Theory Example 0:15:00

Graph Theory Example 1.001-1.002 GATE CS 2012 2013 (Expected no. of cycles)

Graph Theory Example 0:16:31

Graph Theory Example 1.019 GATE CS 2003 Perfect Matching

Graph Theory Example 0:12:53

Graph Theory Example 1.026 GATE CS 2004 (Graph union intersection)

Graph Theory Example 0:07:46

Graph Theory Example 1.024 GATE CS 2009 (Chromatic number)

Graph Theory example 0:10:29

Graph Theory example 1.027 GATE 2010 (degree sequence) part 1 of 2

Graph Theory example 0:07:01

Graph Theory example 1.028 GATE 2003 (min degree)

Graph Theory Example 0:06:16

Graph Theory Example 1.025 GATE CS 2007 (Eulerian Cycle)

Union Intersection Ring 0:08:46

Union Intersection Ring sum and Complement of graph | Operations on Graph | GATECSE | Graph Theory

Degree of a 0:06:39

Degree of a vertex in Graph | Graph Theory #6

Discrete Math - 0:06:19

Discrete Math - 10.1.1 Introduction to Graphs

1 - Graph 0:12:08

1 - Graph Theory Examples: Concepts and Solutions | Graph Theory | Network Theory

Isomorphism in Graph 0:08:35

Isomorphism in Graph Theory in Hindi

Mathematical Logic Example 0:06:48

Mathematical Logic Example 1.001 GATE CS 2007 (Graph Theory and Logic)

Define Walk , 0:09:13

Define Walk , Trail , Circuit , Path and Cycle in a GRAPH | Graph Theory #9

Graph Theory GATE 0:19:26

Graph Theory GATE Question | GATE 2019 CSE

IIT Bombay Lecture 0:00:12

IIT Bombay Lecture Hall | IIT Bombay Motivation | #shorts #ytshorts #iit

Chromatic Number-Graph Theory, 0:06:16

Chromatic Number-Graph Theory, Discrete Mathematics, Data Structures, Definition, concept, GATE 2018

Cosplay by b.tech 0:00:15

Cosplay by b.tech final year at IIT Kharagpur

Imp Question on 0:06:45

Imp Question on Planar Graph for all competitive exams | Graph Theory

GATE CSE 2006 0:06:30

GATE CSE 2006 solution | Graph Theory

Hamiltonian Graph with 0:08:38

Hamiltonian Graph with examples | Hamiltonian Path & Circuit

INDEGREE AND OUTDEGREE 0:01:57

INDEGREE AND OUTDEGREE

Planar Graph and 0:10:08

Planar Graph and Non Planar Graph || Planarity of a Graph || GATECSE || Graph Theory

Graph Theory | 0:16:14

Graph Theory | Graph Isomorphism of Graph in Graph Theory | Discrete Mathematics By GP Sir

Комментарии
Автор

Great Explanation
With this i understood perfectly What is matching and what is perfect matching...:)

jalandharjntu
Автор

Very nice indeed Harshit, strange to find the low count of likes and comments .. kudos

shridharsharma
Автор

Hi, you can calculate by thinking of combination.
Assume the vertex as ball. Let's say there are 6 balls, each ball differes. The problem is how many combinations are there to group the ball into 3 groups, which each group has 2 balls. Because we know it is a complete graph.
We select 2 balls out of 6 balls, there are C(6, 2) possibilities.
In the remaining 4 balls, we select 2 out of 4, there are C(4, 2) possibilities.
Because the 3 groups have the same number of balls, there are duplicate possibilities. So we should divide by A(3, 3).
So, the final answer would be C(6, 2)*C(4, 2)/A(3, 3)=15.

pengli
Автор

5 min ka question 15 min tk explain kiya...Explanation was good but it could be explained in 5 min.

mohitnegi
Автор

Thank u  sir for your effort. God Bless You.

NagaVenkateshgavini
Автор

sir, i liked your videos and it helped me a lot..
i also tried visiting your site.. click2study.net but it says the domain is free and no website is registered.. i was looking for more study material.. if you please help me i would appreciate it as I have my GATE exam round the corner..

Keep up the good work!

sahilpahwa