A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: