Time Left - 15:00 mins
GATE CS 2022 : Discrete Math -2 (App update required to attempt this test)
Attempt now to get your rank among 113 students!
Question 1
The hasse diagram on A = {1, 2, 3, 4} of R = { (1, 1), (1, 2), (2, 2), (2, 4), (1, 3), (3, 3), (3, 4), (1, 4), (4, 4)}. Diagraph will be.
Question 2
Which of the following graphs is connected
Question 3
What is the number of edges present in a complete graph having n vertices?
Question 4
How many minimum spanning trees does the following graph have?
Question 5
The maximum number of edges in a bipartite graph on 12 vertices is_______.
Question 6
Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.
- 113 attempts
- 1 upvote
- 1 comment
Tags :
GATE & PSU CSGeneralMay 26GATE & PSU CS