Recent questions in Discrete Mathematics

#2381
242
views
0 answers
0 votes
How many labelled trees with n vertices
#2382
146
views
0 answers
0 votes
How many simple labelled graphs with n vertices and e edges
#2383
183
views
0 answers
0 votes
For K(n) ( complete graph with n vertices) Q1) how many no of Hamilton cycles ??Q2)how many no of Hamilton cycles start ing and ending with specificed ... How many unordered Hamilton cycles ???Q4) how many edge disjoint Hamilton cycles ???
#2384
295
views
0 answers
0 votes
10 regular is a connected graph or not ???
#2385
204
views
0 answers
0 votes
An edge is present in a && b if a€V1 && b€V2S1: Graph is complete bipartite graphS2: Graph is bipartite graph a) S1 true S2 false b) S1 true S2 true c) S1 false S2 true d) S1 false S1 false
#2386
220
views
0 answers
0 votes
An edge is present in a && b iff a€V1 && b€V2.S1:Graph is complete bipartite graphS2:Graph is bipartite graph a) S1 true, S2 trueb) S1 true, S2 falsec) S1 false ,S2 true d) S1 false ,S2 false
#2387
269
views
0 answers
0 votes
#2388
265
views
0 answers
0 votes
the eigen values of the following matrix -135-3-16003
#2389
1.7k
views
0 answers
0 votes
There is an example in the section 1.6 which goes as:Show that the premises It is not sunny this afternoon and it is colder than yesterday, We will go ... " it does not make sense in any world according to me. Thanks in advance. pq
#2390
214
views
0 answers
0 votes
Show that in a group of 10 people (where any two people are either friends or enemies), there are either three mutual friends or four mutual enemies, and there are either three mutual enemies or four mutual friends.
#2391
1.4k
views
1 answers
3 votes
#2392
492
views
1 answers
1 votes
is there any easy way to do this i did it by making equation,Mn+Ec=Vn, Vc+In=Vn
#2393
552
views
0 answers
0 votes
How many graphs in the above image is connected? I think it is (i) and (iii) but they are saying graph number (ii) is also connected. How?
#2394
528
views
0 answers
0 votes
how to slove
#2395
364
views
0 answers
0 votes
Given a directed graph G, consider forming a graph G0 as follows. Each vertex u0 ∈ G0 represents a strongly connected component (SCC) of G. There is an edge ( ... edge in G from the SCC corresponding to u0 to the SCC corresponding to v0 "
#2396
459
views
0 answers
0 votes
https://gateoverflow.in/2494/gate1994-3-8ANY OF THE ANSWER CAN BE CORRECT? R−(R−S)ANDR ∩ S=R-(U-S)
#2397
984
views
0 answers
0 votes
in this type question i am finding difficulty to solve please tell me the approach with proper explanation
#2398
1.8k
views
2 answers
0 votes
How many partial functions are there from a set with m elements to a set with n elements, where m and n are positive integers?My try : Partial functions are the ones ... we do total - (all are mapped) it will be 0. How to approach it?
#2400
628
views
1 answers
0 votes
I solved it by taking matrix ,I am confused in commutative