Gate CS-2012 Question Paper With Solutions

Q. 38 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) 90

(D) 360

Answer: (C)

Explanation:

Gate CS-2012 Question Paper With Solutions

Learn More:   Gate CS-2014-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here