MCQOPTIONS
Saved Bookmarks
| 1. |
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to |
| A. | 15 |
| B. | 30 |
| C. | 45 |
| D. | 360 |
| Answer» D. 360 | |