InterviewSolution
Saved Bookmarks
| 1. |
Let X and Y be the integers representing the number of simple graphs possible with 3 labeled vertices and 3 unlabeled vertices respectively. Let X – Y = N. Then, find the number of spanning trees possible with N labeled vertices complete graph.(A) 4(B) 8(C) 16(D) 32 |
| Answer» | |