Dark Mode

Recent questions in Discrete Mathematics

1 vote

1 answer

5731

Ace Test Series: Graph Theory - Graph Connectivity
I think the explanation is for edges for which graph is always connected.

Tushar Shinde asked in Graph Theory Jan 24, 2016

by Tushar Shinde

517 views

0 votes

1 answer

5732

Ace Test Series: Set Theory & Algebra - Functions
I thought answer would be (C). Because, inner 'f' is outputting values 8, 9, 3, 1, 2. So, outer 'f' should take these values for final output. But as these values are not in its domain [S], so that should be undefined.. Right?

Tushar Shinde asked in Set Theory & Algebra Jan 24, 2016

by Tushar Shinde

587 views

1 vote

2 answers

5733

Max Number of edges
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 _________.

Akanksha Kesarwani asked in Graph Theory Jan 22, 2016

by Akanksha Kesarwani

2.8k views

0 votes

1 answer

5734

Permutation1.1
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?

Aspi R Osa asked in Combinatory Jan 22, 2016

863 views

0 votes

1 answer

5735

Number of ISOMORPHISMs of a cycle graph?
How many different isomorphisms are there from one cycle on n-vertices to another cycle on n-vertices.

Aspi R Osa asked in Graph Theory Jan 22, 2016

1.4k views

2 votes

1 answer

5736

minimum number of vertices of planner graph of edges e

monali asked in Graph Theory Jan 21, 2016

by monali

316 views

0 votes

1 answer

5737

Find out the equivalent expression
(P∨Q)∧(P→R)∧(Q→S) is equivalent to- a) S∧R b)S→R c)S∨R d)None.

sampad asked in Mathematical Logic Jan 21, 2016

by sampad

580 views

3 votes

2 answers

5738

Lattice vs. hasse diagram
can hasse diagram be Infinite? can lattice be infinite? Whats the difference b/w hasse digram and lattice?

Aspi R Osa asked in Set Theory & Algebra Jan 19, 2016

1.8k views

1 vote

3 answers

5739

Is ϕ REFLEXIVE on R(ϕ->ϕ)?
Is ϕ REFLEXIVE on R(ϕ->ϕ)?

Aspi R Osa asked in Set Theory & Algebra Jan 19, 2016

3.6k views

1 vote

1 answer

5740

Difference b/w validi and tautology?
valid statement. vs. Tautology. please clear someone.

Aspi R Osa asked in Mathematical Logic Jan 19, 2016

589 views

1 vote

4 answers

5741

Associativity of implication?
a + b->c means (a + b)-> c or a + (b->c)?

Aspi R Osa asked in Mathematical Logic Jan 19, 2016

2.0k views

0 votes

0 answers

5742

Sourabh Kumar asked in Set Theory & Algebra Jan 19, 2016

by Sourabh Kumar

246 views

1 vote

3 answers

5743

Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?
Why set of all functions $f:N \rightarrow$ {0,1} is uncountably infinite?

shikharV asked in Set Theory & Algebra Jan 19, 2016

8.6k views

0 votes

1 answer

5744

Calculating number of possible strings
Couldn't understand the method they have used to find the answer. Please explain

shikharV asked in Combinatory Jan 19, 2016

480 views

7 votes

2 answers

5745

Finding matching number of graph
Given explanation: In the above explanation, it is written that matching number is 4 but I am getting matching number as 3 for this graph(choosing edges 1-2, 3-4 and 6-7). Please check where I am going wrong

shikharV asked in Graph Theory Jan 18, 2016

2.2k views

0 votes

1 answer

5746

In how many ways 5 blue pens and 6 black pens can be distributed to 6 children?

pC asked in Combinatory Jan 16, 2016

by pC

446 views

3 votes

2 answers

5747

Recurrance Relation
an = an-1 + n , n>=1 a0=2 Find a100... ? Solution I actually wanted to know what is wrong with this method . Could you pls help Whats wrong here . T(n) = T(n-1)+n and back substitute T(n)= T(n-k) + nk putting n-k = 0 T(n) = 2+ n* n So T(100) = 2+100*100 Actual answer is 5052

pC asked in Combinatory Jan 15, 2016

by pC

517 views

0 votes

0 answers

5748

Pigeon Hole Principle
The least num of computers required to connect 8 computers to 4 printers to guarantee 4 comp can direct]ly access 4 printer is _____ 16 17 19 20 21 closed

pC asked in Set Theory & Algebra Jan 15, 2016

by pC

1.2k views

2 votes

1 answer

5749

MadeEasy Test Series: Set Theory & Algebra - Functions
Let f: A → B and g: B → C denote two functions. Consider the following two statements: S1 : If both f and g are injections then the composition function gof : A → C is an injection. S2 : If the function gof : A → C is surjection ... is a surjection. Which of the above statements are valid? a) S1 only b) S2 only c) S1 and S2 d) None of these

Sandeep Singh asked in Set Theory & Algebra Jan 15, 2016

by Sandeep Singh

573 views

3 votes

2 answers

5750

Counting number of articulation points
Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check

shikharV asked in Graph Theory Jan 15, 2016

1.1k views

Page:

« prev
1
...
282
283
284
285
286
287
288
289
290
291
292
...
355
next »

Recent questions in Discrete Mathematics