MCQOPTIONS
Saved Bookmarks
| 1. |
Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50. |
| A. | 98 |
| B. | 13 |
| C. | 6 |
| D. | 34 |
| Answer» D. 34 | |