Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Discrete Mathematics
0
votes
0
answers
2881
Show that T is a maximum spanning tree for G
Let G=(V,E) a connected graph, and p:E−>R a weight function. We denote |v|=n and E={e1,e2,...,em}, we suppose that ∀i p(ei)≤p(ei+1). 1-Show that in a connected graph G, if T and T′ are two distinct partial ... spaninnig tree on G. 3- Give the complexity of the determination of Tm. Can some one help me in the second and third question? Thank you.
Let G=(V,E) a connected graph, and p:E−>R a weight function. We denote |v|=n and E={e1,e2,...,em}, we suppose that ∀i p(ei)≤p(ei+1).1-Show that in a connected graph...
abram19000
244
views
abram19000
asked
Jul 24, 2018
Graph Theory
graph-theory
graph-algorithms
+
–
1
votes
0
answers
2882
Kenneth Rosen Edition 6th Exercise 1.4 Question 7 e,f (Page No. 58)
Let T (x, y) mean that student x likes cuisine y, where the domain for x consists of all students at your school and the domain for y consists of all cuisines. Express each of these statements by a simple English sentence. e ... have the same opinion (either they both like it or they both do not like it). How to reach the answers?
Let T (x, y) mean that student x likes cuisine y, where thedomain for x consists of all students at your school andthe domain for y consists of all cuisines. Express each...
Sandy Sharma
833
views
Sandy Sharma
asked
Jul 24, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
quantifiers
+
–
0
votes
0
answers
2883
doubt
Q: Identify pigeon and pigeonhole : Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to a server. For each server, only one direct connection to that server can be active at any ... to every server (using 150 connections), what is the minimum number of direct connections needed to achieve this goal? (ans 60)
Q: Identify pigeon and pigeonhole :Suppose that a computer science laboratory has 15 workstations and 10 servers. A cable can be used to directly connect a workstation to...
cool_dude
222
views
cool_dude
asked
Jul 24, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
1
answer
2884
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
abhishek1995_cse
1.3k
views
abhishek1995_cse
asked
Jul 23, 2018
Graph Theory
graph-theory
graph-connectivity
+
–
1
votes
1
answer
2885
ACE Bits And Bytes
Number of perfect matching in Wn (n>=4 and n is even) _________.
Number of perfect matching in Wn (n>=4 and n is even) _________.
abhishek1995_cse
613
views
abhishek1995_cse
asked
Jul 23, 2018
Graph Theory
graph-theory
graph-matching
+
–
0
votes
0
answers
2886
Combinatorics
HeadShot
154
views
HeadShot
asked
Jul 23, 2018
0
votes
1
answer
2887
Linear Recurrence relations
$\text{What is the general form of homogeneous solution for linear nonhomogeneous recurrence relation }$ $a_n = 8 a_{n-2} - 16a_{n-4}$
$\text{What is the general form of homogeneous solution for linear nonhomogeneous recurrence relation }$$a_n = 8 a_{n-2} - 16a_{n-4}$
!KARAN
466
views
!KARAN
asked
Jul 22, 2018
Combinatory
recurrence-relation
+
–
0
votes
1
answer
2888
How to represent First order statements in plain English?
\neg \forall x \neg F(x) in English could we write this as Not for all x F(x) holds or as Not for all x F(x) holds is false.
\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.
rsonx
265
views
rsonx
asked
Jul 22, 2018
0
votes
3
answers
2889
Combinatorics
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 assignments be made?
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 ...
krishn.jh
2.3k
views
krishn.jh
asked
Jul 22, 2018
Combinatory
combinatory
+
–
1
votes
2
answers
2890
fallacy , contradiction and invalid argument are same ?
fallacy , contradiction and invalid argument are same or different
fallacy , contradiction and invalid argument are same or different
Sanjay Sharma
3.4k
views
Sanjay Sharma
asked
Jul 20, 2018
1
votes
1
answer
2891
linear algebra
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 __________
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 __________
piya
1.4k
views
piya
asked
Jul 20, 2018
0
votes
0
answers
2892
doubt
Let f∘g denote function composition such that (f∘g)(x)=f(g(x)). Let f:A→B such that for all g:B→A and h:B→A we have f∘g=f∘h⇒g=h. Which of the following must be true? (ans : one to one) doubt: why it is not onto? Bcz : for function g , (to qualify to be a function, the entire domain of g must be mapped). So, domain of g= range of f.
Let f∘g denote function composition such that (f∘g)(x)=f(g(x)). Let f:A→B such that for all g:B→A and h:B→A we have f∘g=f∘h⇒g=h. Which of the following mu...
cool_dude
197
views
cool_dude
asked
Jul 20, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
0
answers
2893
Set theory
explain
explain
Sabir Khan
146
views
Sabir Khan
asked
Jul 19, 2018
2
votes
0
answers
2894
Generating Function- Where to start?
Hello can anyone suggest good video/book to learn generating functions from?..i tried the nptel lecture..it has some audio lag. and i could not make much out of it..I am well versed in combinatorics but my calculus is weak.. Please suggest some resource that teaches generating functions from scratch
Hello can anyone suggest good video/book to learn generating functions from?..i tried the nptel lecture..it has some audio lag. and i could not make much out of it..I am ...
Tridhara Chakrabarti
2.2k
views
Tridhara Chakrabarti
asked
Jul 19, 2018
Combinatory
generating-functions
preparation
+
–
0
votes
0
answers
2895
SELF DOUBT
https://gateoverflow.in/510/gate1991-01-xv IN THIS QUESTION I AM SOLVING LIKE THIS WE HAVE K COMPONENTS 1,2,3,.................K EACH OF WHICH HAVE N1,N2,N3,.................NK VERTICES SO TOTAL NUMBER OF EDGES ARE N1(N1-1)/2 +N2(N2-1)/2...................NK(NK-1)/2 SO AT SOMEWHERE IN STEPS I REACHED TO 1/2((-N)+N12+N22.......NK2)) NOT GETTING FURTHER FROM HERE ..................
https://gateoverflow.in/510/gate1991-01-xv IN THIS QUESTION I AM SOLVING LIKE THIS WE HAVE K COMPONENTS 1,2,3,.................KEACH OF WHICH HAVE N1,N2,N3,.................
eyeamgj
170
views
eyeamgj
asked
Jul 19, 2018
0
votes
1
answer
2896
Recurrence
saumya mishra
251
views
saumya mishra
asked
Jul 18, 2018
0
votes
1
answer
2897
Graphs
HeadShot
418
views
HeadShot
asked
Jul 18, 2018
0
votes
1
answer
2898
Recurrence relation
saumya mishra
517
views
saumya mishra
asked
Jul 18, 2018
0
votes
1
answer
2899
Graphs
I think ans is option C , But will anybody explain the notation used in option D ?
I think ans is option C , But will anybody explain the notation used in option D ?
HeadShot
426
views
HeadShot
asked
Jul 18, 2018
0
votes
0
answers
2900
Graphs
I am getting n>=9 ,if I consider remaining vertices degree 2 (less than 3). How ans is this small ?
I am getting n>=9 ,if I consider remaining vertices degree 2 (less than 3). How ans is this small ?
HeadShot
307
views
HeadShot
asked
Jul 18, 2018
Page:
« prev
1
...
140
141
142
143
144
145
146
147
148
149
150
...
358
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register