Recent questions in Discrete Mathematics

1 votes
1 answer
5781
Assume G is connected planar graph that has 14 vertices and 20 regions . All interior regions are bounded by a cycle of length 3(i.e. 3 edges). The no of edges bounded t...
0 votes
1 answer
5782
How many 4 digit even number are possible with each digit distinct ?
0 votes
1 answer
5783
1 votes
1 answer
5785
How many seven length palindrome possible using English alphabet.?
1 votes
1 answer
5786
what is the correct solution to this question??
0 votes
1 answer
5787
In how many ways can $2n+1$ seats in a congress be divided among 3 parties so that coalition of any 2 parties will ensure them majority?
1 votes
1 answer
5790
3 votes
2 answers
5791
Which of the following are true?∃x(P(x)->Q(x)) ->(∀xP(x)->∀xQ(x))∃xP(x)->∀x Q(x) ->∀x(P(x)->Q(x))
3 votes
4 answers
5793
number of subgraph for K3 is
1 votes
2 answers
5796
A simple undirected graph ‘X’ has 10 vertices. If ‘X’ has 5 equally sized connected components, the maximum number of edges in graph ‘X’ is _________.
0 votes
1 answer
5797
If there are 9 students in a class and each team contain 3 students then how many number of ways 9 students can be partitioned into 3 teams?Why is this not 9C3*6C3*3C3?
0 votes
1 answer
5798
How many different isomorphisms are there from one cycle on n-vertices to another cycle on n-vertices.
2 votes
1 answer
5799
0 votes
1 answer
5800
(P∨Q)∧(P→R)∧(Q→S) is equivalent to-a) S∧Rb)S→Rc)S∨Rd)None.