Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Граф, у якого кожна пара вершин − зв’язна, є:
незв’язний
зв’язний
простий
повний
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!