GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
46 views
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
asked in Graph Theory by Veteran (10.1k points)   | 46 views

1 Answer

+5 votes
Best answer

Matching number of a graph is defined as the maximum number of non-adjacent edges in a graph.

(I have marked one maximum-possible set of non-adjacent edges, but other set is also possible)

In a complete bipartite graph $K_{m,n}$ $m$ nodes are adjacent to each of the $n$ nodes and $n$ nodes are adjacent to each of $m$ nodes. (basic definition of bipartite graph)

So, If an edge is to be included in counting of Matching number, then all adjacent edges cannot be included. 

So, Matching Number in $K_{2,3} = 2$ and in $K_{3,3} = 3$

Although there may exist a much formal proof, but by taking few more examples it can be said that Matching Number for $\color{maroon}{K_{m,n} = \;min(m,n)}$

answered by Veteran (22k points)  
selected by

Related questions

+3 votes
1 answer
1
asked in Graph Theory by Rohan Mundhey Loyal (4.2k points)   | 80 views
+1 vote
1 answer
2
asked in Graph Theory by shikharV Boss (5.1k points)   | 148 views
Top Users Jan 2017
  1. Debashish Deka

    8126 Points

  2. sudsho

    5042 Points

  3. Habibkhan

    4706 Points

  4. Vijay Thakur

    4458 Points

  5. Bikram

    4348 Points

  6. saurabh rai

    4212 Points

  7. Arjun

    4010 Points

  8. santhoshdevulapally

    3722 Points

  9. GateSet

    3292 Points

  10. Sushant Gokhale

    3286 Points

Monthly Topper: Rs. 500 gift card

19,122 questions
24,033 answers
52,725 comments
20,276 users