Register
Filter

Most answered questions in Discrete Mathematics

0 votes
1 answer
2553
graph theory
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connected unilaterally connected strongly connected disconnected
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connectedunilaterally conne...
User Avatar
1 votes
1 answer
2554
AAI JE (IT) 2019 Q-30
Can someone solve this and tell how it’s 160.
Can someone solve this and tell how it’s 160.
User Avatar
1 votes
1 answer
2555
ME Test Series
User Avatar
1 votes
1 answer
2556
Doubt : ACE OTS 1
Prove S1 without using venn -diagram ( using boolean algebra )
Prove S1 without using venn -diagram ( using boolean algebra )
User Avatar
1 votes
1 answer
2557
GATE 2007 MA Group Theory
User Avatar
0 votes
1 answer
2558
Kenneth Rosen Edition 6th Exercise 6.1 Example 7 (Page No. 399)
this is an example taken from Rosen. but I’m unable to understand to understand the solution given there can someone pls explain me in details
this is an example taken from Rosen. but I’m unable to understand to understand the solution given therecan someone pls explain me in details
User Avatar
0 votes
1 answer
2560
Propositional Logic
Which of the following is the best English translation for All humans eat alligator Alligator eats only human Every Alligator Eats Human Only Alligator eats Human
Which of the following is the best English translation for All humans eat alligatorAlligator eats only humanEvery Alligator Eats HumanOnly Alligator eats Human
User Avatar
4 votes
1 answer
2561
Propositional Logic
Which of the following is/are TRUE? $(∀x)(∃y) J(x,y) \equiv (∃y)(∀x) J(x,y)$ $(∃x)(∀y) J(x,y) \equiv (∀y)(∃x) J(x,y)$ $(∀x)(∀y) J(x,y) \equiv (∀y)(∀x) J(x,y)$ $(∃x)(∃y) J(x,y) \equiv (∃y)(∃x) J(x,y)$
Which of the following is/are TRUE?$(∀x)(∃y) J(x,y) \equiv (∃y)(∀x) J(x,y)$$(∃x)(∀y) J(x,y) \equiv (∀y)(∃x) J(x,y)$$(∀x)(∀y) J(x,y) \equiv (∀y)(∀x...
User Avatar
1 votes
1 answer
2563
Tautology?
Why this the following not a tautology? There is no case in which RHS is False and LHS is True. $\Bigl [ (\lnot p \land q) \land \bigl[ q \to (p \to q) \bigr ] \Bigr ] \to \lnot r$
Why this the following not a tautology? There is no case in which RHS is False and LHS is True.$\Bigl [ (\lnot p \land q) \land \bigl[ q \to (p \to q) \bigr ] \Bigr ] \to...
User Avatar
0 votes
1 answer
2564
Doubt
State True/False(with reason). 1. Every non-empty set of non-negative integers has a least element. 2. Every non-empty set of non-negative rationals has a least element. 3. Every non-empty set of integers has a least element.
State True/False(with reason).1. Every non-empty set of non-negative integers has a least element.2. Every non-empty set of non-negative rationals has a least element.3. ...
User Avatar
1 votes
1 answer
2566
#relation
The Number of Relations, Which are both Reflexive and Symmetric but not Anti-Symmetric, on a set with 6 elements, are ____________?
The Number of Relations, Which are both Reflexive and Symmetric but not Anti-Symmetric, on aset with 6 elements, are ____________?
User Avatar
0 votes
1 answer
2567
Counting MadeEasy
User Avatar
0 votes
1 answer
2568
Planar Graph
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
Let G be a simple connected planar graph with 14 vertices and 20 edges. Number of closed regions in planar embedding of the graph is ?
User Avatar
0 votes
1 answer
2569
Undirected Graph - Hamiltonian Cycle - NP Complete?
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
User Avatar
0 votes
1 answer
2570
Quantifiers valid statement
How did this statement is valid please explain
How did this statement is valid please explain
User Avatar
Page: