engineering recuitment Beltron Programmer Mock Test 2024 Engineering Mathematics Graph Theory Graphs
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
1
15
2
30
3
45
4
360