Register
Filter

Hot questions in Discrete Mathematics

947
views
1 answers
3 votes
GATE CSE 1987 | Question: 9f
Give the composition tables (Cayley Tables) of the two non-isomorphic groups of order $4$ with elements $e, a, b, c$ where $c$ is the identity element. Use the order $e, a, b, c$ for the rows and columns.
Give the composition tables (Cayley Tables) of the two non-isomorphic groups of order $4$ with elements $e, a, b, c$ where $c$ is the identity element. Use the order $e, ...
User Avatar
748
views
1 answers
6 votes
TIFR CSE 2016 | Part B | Question: 11
Let $n \geq 4$ be an integer. Regard the set $\mathbb{R}^n$ as a vector space over $\mathbb{R}$. Consider the following undirected graph $H$ ... inifinite number of vertices The diameter of $H$ is infinite $H$ is conneceted $H$ contains an infinite clique $H$ contains an infinite independent set
Let $n \geq 4$ be an integer. Regard the set $\mathbb{R}^n$ as a vector space over $\mathbb{R}$. Consider the following undirected graph $H$.$$ V(H) = \{S \subseteq \math...
User Avatar
588
views
1 answers
1 votes
Doubt
How many distinct unlabeled graphs are there with 4 vertices and 3 edges?
How many distinct unlabeled graphs are there with 4 vertices and 3 edges?
User Avatar
1.6k
views
1 answers
3 votes
kenneth rosen Ex2.4 Q.46
Show that the set of functions from the positive integers to the set {0,1,2,3,4,5,6,7,8,9} is uncountable.
Show that the set of functions from the positive integers to the set {0,1,2,3,4,5,6,7,8,9} is uncountable.
User Avatar
444
views
1 answers
1 votes
graph Theory
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j):1<=i<=12,1<=j<=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 and |b-d|<=1. The number of edges in this graph is __________.
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i,j):1<=i<=12,1<=j<=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 ...
User Avatar
344
views
2 answers
1 votes
Test by Bikram | Mathematics | Test 2 | Question: 22
Which one of the following is a Partial Order Relation ? Refer the Partial Order Diagram above. b and c a and b a and c c only
Which one of the following is a Partial Order Relation ?Refer the Partial Order Diagram above.b and ca and ba and cc only
User Avatar
1.3k
views
1 answers
1 votes
relation
A binary relation R on Z × Z is defined as follows: (a, b) R (c, d) iff a = c or b = d Consider the following propositions: 1. R is reflexive. 2. R is symmetric. 3. R is antisymmetric. Which one of the following statements is True? A Both 1 and 2 are true B 1 is true and 2 is false C 1 is false and 3 is true D Both 2 and 3 are true
A binary relation R on Z × Z is defined as follows: (a, b) R (c, d) iff a = c or b = dConsider the following propo...
User Avatar
312
views
1 answers
0 votes
Kenneth Rosen Edition 7 Exercise 2.3 Question 72 (Page No. 155)
Suppose that $f$ is a function from $A$ to $B$, where $A$ and $B$ are finite sets with $|A|=|B|$. Show that $f$ is one-to-one if and only if it is onto.
Suppose that $f$ is a function from $A$ to $B$, where $A$ and $B$ are finite sets with $|A|=|B|$. Show that $f$ is one-to-one if and only if it is onto.
User Avatar
1.3k
views
1 answers
0 votes
Kenneth Rosen Edition 7 Exercise 2.1 Question 19 (Page No. 126)
What is the cardinality of each of these sets? {$a$} {{$a$}} {$a$, {$a$}} {$a$,{$a$},{$a$, {$a$}}}
What is the cardinality of each of these sets?{$a$}{{$a$}}{$a$, {$a$}}{$a$,{$a$},{$a$, {$a$}}}
User Avatar
4.6k
views
3 answers
3 votes
Ace Test Series: Graph Theory - Number Of Spanning Trees
How to approach such questions ? Please provide detailed solution. Answer given is option C
How to approach such questions ? Please provide detailed solution. Answer given is option C
User Avatar
3.5k
views
2 answers
0 votes
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
553
views
0 answers
0 votes
GATE 1992
How is option (a) correct? Isn’t Universal quantifier not distributive over union/disjunction. Source: https://cse.buffalo.edu/~rapaport/191/distqfroverandor.html
How is option (a) correct? Isn’t Universal quantifier not distributive over union/disjunction.Source: https://cse.buffalo.edu/~rapaport/191/distqfroverandor.html
User Avatar
615
views
0 answers
0 votes
Bounded lattice
Can a countable infinite lattice be bounded?
Can a countable infinite lattice be bounded?
User Avatar
1.9k
views
1 answers
0 votes
Set theory
i am not able to understand the proof. How we reached statement 2 from statement 1 as I have marked in the picture (right side) Can some one elaborate?
i am not able to understand the proof.How we reached statement 2 from statement 1 as I have marked in the picture (right side)Can some one elaborate?
User Avatar
608
views
1 answers
0 votes
Self doubt group theory
Is (Z+,>=) a well oerderd set ,plz explain.
Is (Z+,>=) a well oerderd set ,plz explain.
User Avatar
598
views
1 answers
0 votes
Kenneth Rosen Edition 6th Exercise 7.5 Question 3 e (Page No. 507)
Which of these relations on the set of all functions from Z to Z are equivalence relations? Determine the properties of an equivalence relation that the others lack. {(f, g) | f(0) = g(1) and f(1) = g(0)} In ... made to check the reflexive property. Why can't we check f(0)=f(0) to confirm the reflexive property. Please help.
Which of these relations on the set of all functions from Z to Z are equivalence relations? Determine the properties of an equivalence relation that the others lack. {(f,...
User Avatar
7.9k
views
2 answers
38 votes
GATE CSE 2015 Set 2 | Question: 16
Let $R$ be the relation on the set of positive integers such that $aRb$ and only if $a$ and $b$ are distinct and let have a common divisor other than $1.$ Which one of the following statements about $R$ is true? $R$ is ... but not symmetric not transitive $R$ is transitive but not reflexive and not symmetric $R$ is symmetric but not reflexive and not transitive
Let $R$ be the relation on the set of positive integers such that $aRb$ and only if $a$ and $b$ are distinct and let have a common divisor other than $1.$ Which one of th...
User Avatar
271
views
1 answers
0 votes
self doubt about maths practice
Where can i find only maths PYQ all branches . for practice ?
Where can i find only maths PYQ all branches . for practice ?
User Avatar
458
views
2 answers
2 votes
Combinatoric
Find number of zero's at the end of (2018)! ?
Find number of zero's at the end of (2018)! ?
User Avatar
Page: