Test Index

GATE Computer Science (CS) 2012 Solved Paper

© examsnet.com

Question : 48

Total: 65

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

15
30
45
360

Go to Question:

Prev Question

Next Question