MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Consider the following statements:(i) A graph in which there is a unique path between every pair of vertices is a tree.(ii) A connected graph with e = v - 1 is a tree.(iii) A graph with e = v - 1 that has no circuit is a tree.Which of the above statements is/are true? |
| A. | (i) u0026 (iii) |
| B. | (ii) u0026 (iii) |
| C. | (i) u0026 (ii) |
| D. | All of the above |
| Answer» E. | |