The Gateway to Computer Science Excellence
+4 votes

Find the matching number for the given graph-

in Graph Theory by Active (1.2k points)
edited by | 311 views

2 Answers

+8 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
by Boss (13.9k points)
+2 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.

by Loyal (6.4k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,834 questions
57,854 answers
108,396 users