Register

Recent questions tagged discrete-mathematics

1.3k
views
3 answers
3 votes
Ace Test Series: Graph Theory - Degree Of Graph
How to PROVE S2 is correct??Consider the statements $S_1$ ) In any simple graph with more than one vertex, there must exist at-least $2$ vetices of the same degree ... $S_1$ is false and $S_2$ is trueD). Both $S_1$ and $S_2$ are true
User Avatar
415
views
0 answers
3 votes
Functions || Proof
Suppose that $f$ is a function from $A$ to $B$.We define the function $S_f$ from $P(A)$ to $P(B)$ by the rule $S_f (X) = f (X)$ for each subset $X$ of $A$. ... is a one-to-one correspondence from $P(B)$ to $P(A)$.[Hint: Use parts (a)-(d).]
User Avatar
4.2k
views
4 answers
32 votes
TIFR CSE 2015 | Part A | Question: 8
There is a set of $2n$ people: $n$ male and $n$ female. A good party is one with equal number of males and females (including the one where none are invited). The total number ... }$n^{2}$\binom{n}{⌊n/2⌋}^{2}$\binom{2n}{n}$None of the above
User Avatar
4.6k
views
1 answers
1 votes
Rosen 8.2.54.
If G is a simple graph with 15 edges and $\bar{G}$ has 13 edges, how many vertices does G have?
User Avatar
3.8k
views
3 answers
24 votes
TIFR CSE 2014 | Part A | Question: 5
The rules for the University of Bombay five-a-side cricket competition specify that the members of each team must have birthdays in the same month. What is the minimum ... $91$60$49$None of the above
User Avatar
3.4k
views
5 answers
22 votes
TIFR CSE 2013 | Part A | Question: 9
There are $n$ kingdoms and $2n$ champions. Each kingdom gets $2$ champions. The number of ways in which this can be done is:$\frac{\left ( 2n \right )!}{2^{n}}$\frac{\left ... left ( 2n \right )!}{2^{n} . n!}$\frac{n!}{2}$None of the above
User Avatar
906
views
1 answers
2 votes
Number of onto function
Total onto function from a to b with cardinality 4 and 3 respectively??
User Avatar
7.6k
views
4 answers
4 votes
No of surjective functions
The number of surjective (onto) functions defined from $A$ to $B$ where |A| = 5, |B| = 4, is _______
User Avatar
11.1k
views
3 answers
16 votes
number of perfect matching in complete graph
Is there a way to find no of perfect matchings in a complete graph Kn where n could be either even or odd..?
User Avatar
6.5k
views
2 answers
29 votes
GATE IT 2004 | Question: 3
Let $a(x, y), b(x, y,)$ and $c(x, y)$ be three statements with variables $x$ and $y$ ...
User Avatar
Page: