Time Left - 15:00 mins

GATE CS 2021 : Discrete Math Quiz -7

Attempt now to get your rank among 309 students!

Question 1

let G be a graph having 12 vertices and 3 components. The maximum number of edges in G is

Question 2

Which of the following is true?

Question 3

The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences cannot be the degree sequence of any graph?

(I) 7, 6, 5, 4, 4, 3, 2, 1

(II) 6, 6, 6, 6, 3, 3, 2, 2

(III) 7, 6, 6, 4, 4, 3, 2, 2

(IV) 8, 7, 7, 6, 4, 2, 1, 1

Question 4

A cyclic graph Cn where n is number of vertices is?

Question 5

Let G=(V,E) be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition on V into two non-empty and non-overlapping subsets S and T. Which of the following is true?

Question 6

In order to find whether graph contain cycle or not, one can use method
  • 309 attempts
  • 1 upvote
  • 0 comments
Sep 29GATE & PSU CS