1

GATE CSE 2007

MCQ (Single Correct Answer)

+2

-0.6

What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?

2

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

Consider the depth-first-search of an undirected graph with 3 vertices P, Q, and R. Let discovery time d(u) represent the time instant when the vertex u is first visited, and finish time f(u) represent the time instant when the vertex u is last visited. Given that

d(P) = 5 units f(P) = 12 units

d(Q) = 6 units f(Q) = 10 units

d(R) = 14 unit f(R) = 18 units

Which one of the following statements is TRUE about the graph

d(P) = 5 units f(P) = 12 units

d(Q) = 6 units f(Q) = 10 units

d(R) = 14 unit f(R) = 18 units

Which one of the following statements is TRUE about the graph

3

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

Let T be a depth first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of both u and v in G are at least 2. which one of the following statements is true?

4

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

Let T be a depth-first search tree in an undirected graph G. Vertices u and v are
leaves of this tree T. The degrees of both u and v in G are at least 2. Which one
of the following statements is true?

Questions Asked from Graphs (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages