Vidyalelo
Data Structure · Q302

Miscellaneous on Data Structures

Programming · Data Structure · question 302

Q302

In a graph G, the total number of edges in maximum matching is called?

A.
Matching number
Answer
B.
Chromatic number
C.
Domination number
D.
Independence number

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board