Search results for discrete-mathematics

32 votes
14 answers
1
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!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
0 votes
2 answers
5
0 votes
4 answers
11
0 votes
1 answer
17
Maximum number of Simple graphs possible with $n$ vertices$2^{n(n-1)/2}$$2^{(n-1)/2}$$2^{n(n+1)/2}$$2^{n(n+1)}$