Every non trivial loop less graph has
(a) Exactly 2 cut vertices
(b) Exactly 2 non cut vertices
(c) At least 2 non cut vertices
(d) At most 2 non cut vertices
Answers
Answered by
0
Answer:
the correct answer is option a.
Step-by-step explanation:
if this answer will help you then please give me too many thanks and please follow me guys
thank you
Answered by
0
Answer:
hhgghhhhhkkkkkkkk jello
Similar questions