GATE Computer Science (CS) 2012 Solved Paper

Question : 48 of 65

Marks: +1, -0

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