GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
147 views

Find the matching number for the given graph-

asked in Graph Theory by Active (1.2k points)   | 147 views

2 Answers

+4 votes
Matching  it means that no 2 edges are adjacent simply a vertex with degree 1

if we have a vertex with degree 0 we say not matched

In the above graph if we start with G we have 2 edges for G In matching we consider 1 edge since if both are considered we get degree of G as 2 so if we consider G-A edge then node 2 is alone and has degree 0 it makes graph to be not matched so we consider G-2 edge , A-0 edge  T has edges with 0 and 1 since A-0 edge is present if we consider 0 then degree of 0 is 2 so we don't consider

we have T-1 edge then we are left with edge E-6

Totally we get (G-2),(A-0),(T-1),(E-6) so matching number is 4
answered by Veteran (13.8k points)  
0 votes

The matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set.

and maximum means max beween the minimal independence edge sets,which we can form from the graph.So here  

maximum independent edge set is { (G,2) , (A,0) , (T,1) , (E,6) } hence ans is 4.

 

answered by Boss (6.4k points)  

Related questions

+1 vote
2 answers
1
asked in Graph Theory by shikharV Boss (5.2k points)   | 208 views
0 votes
1 answer
3


Top Users May 2017
  1. akash.dinkar12

    3152 Points

  2. pawan kumarln

    1630 Points

  3. sh!va

    1590 Points

  4. Arjun

    1350 Points

  5. Devshree Dubey

    1246 Points

  6. Angkit

    1044 Points

  7. Debashish Deka

    1022 Points

  8. Bikram

    972 Points

  9. LeenSharma

    820 Points

  10. Prashant.

    692 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. pawan kumarln

    256 Points

  2. Ahwan

    232 Points

  3. jjayantamahata

    114 Points

  4. joshi_nitish

    114 Points

  5. Arnab Bhadra

    94 Points


22,731 questions
29,061 answers
65,094 comments
27,625 users