MCQOPTIONS
Saved Bookmarks
| 1. |
             is the maximum number of edges in an acyclic undirected graph with k vertices. |
| A. | k-1 |
| B. | k2 |
| C. | 2k+3 |
| D. | k3+4 |
| Answer» B. k2 | |