Ask Question
24 July, 18:29

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

+4
Answers (2)
  1. 24 July, 18: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
  2. 24 July, 18:35
    0
    It's true because it's true
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 the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers