Recent questions in Discrete Mathematics

0 votes
1 answer
2884
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
1 votes
1 answer
2885
Number of perfect matching in Wn (n>=4 and n is even) _________.
0 votes
0 answers
2886
0 votes
1 answer
2887
$\text{What is the general form of homogeneous solution for linear nonhomogeneous recurrence relation }$$a_n = 8 a_{n-2} - 16a_{n-4}$
0 votes
1 answer
2888
\neg \forall x \neg F(x) in English could we write thisas Not for all x F(x) holdsor as Not for all x F(x) holds is false.
0 votes
3 answers
2889
A company hires 11 new employees, each of whom is to be assigned to one of 4 subdivisions. Each subdivision will get at least one new employee.In how many ways can these ...
1 votes
2 answers
2890
fallacy , contradiction and invalid argument are same or different
1 votes
1 answer
2891
The matrix A has (1, 2, 1)^T and (1, 1, 0)^T as eigenvectors, both with eigenvalue 7, and its trace is 2. The determinant of A is __________
0 votes
0 answers
2893
explain
0 votes
1 answer
2896
0 votes
1 answer
2897
0 votes
1 answer
2898
0 votes
1 answer
2899
I think ans is option C , But will anybody explain the notation used in option D ?
0 votes
0 answers
2900
I am getting n>=9 ,if I consider remaining vertices degree 2 (less than 3). How ans is this small ?