1
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
A
n!
B
1
C
(n - 1)!
D
$${{\left( {n - 1} \right)!} \over 2}$$
2
GATE CSE 2018
Numerical
+1
-0
Let $$G$$ be a finite group on $$84$$ elements. The size of a largest possible proper subgroup of $$G$$ is ________.
Your input ____
3
GATE CSE 2018
Numerical
+1
-0
The chromatic number of the following graph is _______. GATE CSE 2018 Discrete Mathematics - Graph Theory Question 14 English
Your input ____
4
GATE CSE 2016 Set 2
Numerical
+1
-0
The minimum number of colours that is sufficient to vertex-colour any planar graph is _____________ .
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12