Previous GATE Questions in Discrete Mathematics

28 votes
8 answers
41
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
28 votes
6 answers
42
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is...
20 votes
2 answers
43
Determine the number of positive integers $(\leq 720)$ which are not divisible by any of $2,3$ or $5.$
33 votes
14 answers
46
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}...
19 votes
18 answers
47
13 votes
4 answers
50
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...
29 votes
4 answers
53
32 votes
5 answers
54
42 votes
11 answers
55
2 votes
1 answer
56
https://gateoverflow.in/118312/gate2017-1-31In the explanation of how 1st statement is truethey have said that $\lambda$12 + $\lambda$22 <=50How is this statement arrived...
44 votes
9 answers
59
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
58 votes
9 answers
60
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .