The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Sahil Arora 2
User Sahil Arora 2
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sahil Arora 2
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
8
answers
1
GATE201912
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 $n!$ $(n1)!$ $1$ $\frac{(n1)!}{2}$
answered
Feb 7
in
Graph Theory

3.3k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
3
answers
2
GATE 2019 23
Q.23 Two numbers are chosen independently and uniformly at random from the set (1, 2,..., 13]. The probability (rounded off to 3 decimal places) that their 4bit (unsigned) binary representations have the same most significant bit is
commented
Feb 7
in
Probability

773
views
usergate2019
usermod
probability
numericalanswers
normal
50,650
questions
56,236
answers
194,257
comments
95,862
users