Ask Question
26 April, 10:02

In a weakly connected graph. it is not possible to reach all other vertices from any one vertext (true) (false)

+5
Answers (2)
  1. 26 April, 12:25
    0
    It's true because it's true
  2. 26 April, 13:34
    0
    True it is true because you can reach the vertext at all times try it out my teacher told me right now check it our
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “In a weakly connected graph. it is not possible to reach all other vertices from any one vertext (true) (false) ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers