Let G be a complete undirected graph on 6 vertices. If vertices of G are…
GATE · 2012 · CS · Computer Science & ITModified — slightly modified from the official paper; see the solution
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
Attempted by 427 students.
Sign up free to check your answer
Sign up freeLoading lesson…