Question 55

If in a graph G there is one and only one path between everypair of vertices then G is a

Create a FREE account and get:

  • Download Maths Shortcuts PDF
  • Get 300+ previous papers with solutions PDF
  • 500+ Online Tests for Free