The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
9
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, 2019
in
Graph Theory

5.7k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
4
answers
2
GATE201923
Two numbers are chosen independently and uniformly at random from the set $ [ 1, 2, \dots, 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, 2019
in
Probability

1.5k
views
gate2019
probability
52,345
questions
60,510
answers
201,921
comments
95,350
users