Register
Filter

Recent questions in Discrete Mathematics

0 votes
0 answers
2924
graph theory
10.A graph G has any two vertices connected by exactly one path. Find the Number of ways we can properly colour G it we are provided with 10 colours.
10.A graph G has any two vertices connected by exactly one path. Find theNumber of ways we can properly colour G it we are provided with 10colours.
User Avatar
0 votes
2 answers
2925
Number of relation
How many relations are there on a set with 10 elements that are reflexive and symmetric??
How many relations are there on a set with 10 elements that are reflexive and symmetric??
User Avatar
0 votes
1 answer
2926
Kenneth Rosen Edition 6th Exercise 7.4 Example 7 (Page No. 493)
I am not getting the (2n-1) factor. n^2 is for matrix mul and multiplication is being done (n-1) times. so n^2(n-1) is understood. But what is (2n-1)??
I am not getting the (2n-1) factor. n^2 is for matrix mul and multiplication is being done (n-1) times. so n^2(n-1) is understood. But what is (2n-1)??
User Avatar
0 votes
1 answer
2927
logic and predicate
User Avatar
1 votes
0 answers
2928
POSET
Is there any formula exist that will give count of number of set S where S is a subset of POSET P on a given relation R that will consist of.. 1 . atleast 1 minimal element 2. atleast 1 maximal element. ?
Is there any formula exist that will give count of number of set S where S is a subset of POSET P on a given relation R that will consist of..1 . atleast 1 minimal elemen...
User Avatar
0 votes
1 answer
2929
propositional logic
convert the following sentence in logic a mushroom is not poisonous unless it is purple. where mushroom ,purple ,poisonous are the propositional constants
convert the following sentence in logic a mushroom is not poisonous unless it is purple.where mushroom ,purple ,poisonous are the propositional constants
User Avatar
1 votes
1 answer
2930
Functions
Please explain according to options, that would be a great help :)
Please explain according to options, that would be a great help :)
User Avatar
0 votes
0 answers
2931
#doubt
Let f∘gf∘g denote function composition such that (f∘g)(x)=f(g(x))(f∘g)(x)=f(g(x)). Let f:A→Bf:A→B such that for all g:B→Ag:B→A and h:B→Ah:B→A we have f∘g=f∘h⇒g=hf∘g=f∘h⇒g=h. Which of the following must be true? Ans: One-one. My doubt: WHY IT IS NOT ONTO ?
Let f∘gf∘g denote function composition such that (f∘g)(x)=f(g(x))(f∘g)(x)=f(g(x)). Let f:A→Bf:A→B such that for all g:B→Ag:B→A and h:B→Ah:B→A we have ...
User Avatar
0 votes
1 answer
2934
UGC NET CSE | July 2018 | Part 2 | Question: 81
E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by $O \: (E*f)$ $O \: (E^2*f)$ $O \: (E*f^2)$ $O \: (E^2*f^2)$
E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by$O \: (E*...
User Avatar
0 votes
2 answers
2935
UGC NET CSE | July 2018 | Part 2 | Question: 85
The equivalence of $\neg \: \exists \: x \: Q \: (x)$ is $\exists \: x \: \neg \: Q \: (x)$ $\forall \: x \: \neg \: Q \: (x)$ $\neg \: \exists \: x \: \neg \: Q \: (x)$ $\forall \: x \: Q \: (x)$
The equivalence of $\neg \: \exists \: x \: Q \: (x)$ is$\exists \: x \: \neg \: Q \: (x)$$\forall \: x \: \neg \: Q \: (x)$$\neg \: \exists \: x \: \neg \: Q \: (x)$$\f...
User Avatar
0 votes
4 answers
2936
UGC NET CSE | July 2018 | Part 2 | Question: 86
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ is Z Q R C
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ isZQRC
User Avatar
0 votes
1 answer
2937
UGC NET CSE | July 2018 | Part 2 | Question: 87
Match the following in $\textbf{List-I}$ and $\textbf{List-II}$, for a function $f$ ... $\text{(a)-(ii), (b)-(i), (c)-(iii)}$ $\text{(a)-(ii), (b)-(iii), (c)-(i)}$
Match the following in $\textbf{List-I}$ and $\textbf{List-II}$, for a function $f$ :$\begin{array}{clcl} \text{} & \textbf{List-I} & & \textbf{List-II} \\ \text{(a)} & ...
User Avatar
Page: