Register
Filter

Most viewed questions in Discrete Mathematics

6 votes
3 answers
2311
CMI2018-A-4
Let $G=(V, E)$ be an undirected simple graph, and $s$ be a designated vertex in $G.$ For each $v\in V,$ let $d(v)$ be the length of a shortest path between $s$ and $v.$ For an edge $(u,v)$ in $G,$ what can not be the value of $d(u)-d(v)?$ $2$ $-1$ $0$ $1$
Let $G=(V, E)$ be an undirected simple graph, and $s$ be a designated vertex in $G.$ For each $v\in V,$ let $d(v)$ be the length of a shortest path between $s$ and $v.$ ...
User Avatar
1 votes
3 answers
2314
Set theory doubt
Say if A is proper subset of B i.e A⊂B then is it true - that B⊆A (B is subset of A)? Also one more thing - if A⊂B then AUB = A where U means UNION
Say if A is proper subset of B i.e A⊂B then is it true - that B⊆A (B is subset of A)?Also one more thing - if A⊂B then AUB = A where U means UNION
User Avatar
1 votes
1 answer
2315
Recurrence Relation
The solution of an = 2an-1 + 1 where a0 = 1 is ? Please use the substitution method because I seem to have problem understanding it.
The solution of an = 2an-1 + 1 where a0 = 1 is ? Please use the substitution method because I seem to have problem understanding it.
User Avatar
0 votes
1 answer
2320
A question paper is divided into two parts A and B and each part contains 5 questions. In how many ways a student can answer the question paper, if he has to solve total 6 questions including atleast 2 from each section.
I solved the question using the logic first select two questions from each sections. ($\binom{5}{2} * \binom{5}{2}$). Then from remaining 6 questions choose any 2. theref...
User Avatar
2 votes
1 answer
2321
Function One to one / onto
which one is correct?
which one is correct?
User Avatar
1 votes
0 answers
2323
doubt
Is a null matrix also a diagonal matrix? i read somewhere atleast one element in diagonal should be non zero to be a diagonal matrix //provided null matrix will be square and can a null square matrix be a scalar matrix ?
Is a null matrix also a diagonal matrix? i read somewhere atleast one element in diagonal should be non zero to be a diagonal matrix //provided null matrix will be squar...
User Avatar
1 votes
3 answers
2324
One to one function
Following is the way of checking the one to one function or Can i use bi implication in between these?If not,then why?
Following is the way of checking the one to one functionorCan i use bi implication in between these?If not,then why?
User Avatar
0 votes
0 answers
2325
ME TEST SERIES
plz explain the definition of empty set!
plz explain the definition of empty set!
User Avatar
0 votes
1 answer
2328
ME test
Which of the following is correct? A) Every Distributive Lattice is Complimented Lattice B) Every Complimented Lattice is Distributive Lattice C) Every Distributive Lattice is Bounded Lattice D) None of these
Which of the following is correct?A) Every Distributive Lattice is Complimented LatticeB) Every Complimented Lattice is Distributive LatticeC) Every Distributive Lattice ...
User Avatar
3 votes
1 answer
2330
UGC NET CSE | December 2011 | Part 2 | Question: 5
Maximum number of edges in a n -Node undirected graph without self loop is $n^{2}$ $n(n – 1)$ $n(n + 1)$ $\frac{n(n - 1)}{2}$
Maximum number of edges in a n -Node undirected graph without self loop is$n^{2}$$n(n – 1)$ $n(n + 1)$$\frac{n(n - 1)}{2}$
User Avatar
Page: