First time here? Checkout the FAQ!
+3 votes

Find the matching number for the given graph-

asked in Graph Theory by Active (1.2k points)   | 143 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.7k 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
asked in Graph Theory by shikharV Boss (5.1k points)   | 195 views
0 votes
1 answer

Top Users Mar 2017
  1. rude

    5152 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2732 Points

  5. Debashish Deka

    2602 Points

  6. 2018

    1574 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1386 Points

  9. Bikram

    1354 Points

  10. Sanjay Sharma

    1128 Points

Monthly Topper: Rs. 500 gift card

21,537 questions
26,871 answers
23,220 users