1

GATE CSE 2005

MCQ (Single Correct Answer)

+1

-0.3

Let $$G$$ be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the graph is:

2

GATE CSE 2005

MCQ (Single Correct Answer)

+1

-0.3

Let $$G$$ be the simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of $$G$$ is 8. Then, the size of the maximum independent set of $$G$$ is:

3

GATE CSE 2004

MCQ (Single Correct Answer)

+1

-0.3

What is the maximum number of edges in an acyclic undirected graph with $$n$$ vertices?

4

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-0.3

Let $$G$$ be an arbitrary graph with $$n$$ nodes and $$k$$ components. If a vertex is removed from $$G$$, the number of components in the resultant graph must necessarily lie between

Questions Asked from Graph Theory (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2022 (2)
GATE CSE 2021 Set 2 (1)
GATE CSE 2019 (1)
GATE CSE 2018 (2)
GATE CSE 2016 Set 2 (1)
GATE CSE 2014 Set 1 (2)
GATE CSE 2014 Set 3 (1)
GATE CSE 2013 (2)
GATE CSE 2012 (1)
GATE CSE 2011 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (2)
GATE CSE 2008 (2)
GATE CSE 2007 (4)
GATE CSE 2006 (2)
GATE CSE 2005 (2)
GATE CSE 2004 (1)
GATE CSE 2003 (1)
GATE CSE 2002 (1)
GATE CSE 1994 (1)
GATE CSE 1992 (2)

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