Q306
In a perfect matching of graph G, every vertex is connected to how many edges?
A.
At most one
B.
At least one
C.
Exactly one
AnswerD.
Zero
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board