1

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

Consider the undirected graph $$G$$ defined as follows. The vertices of $$G$$ are bit strings of length $$n$$. We have an edge between vertex $$u$$ and vertex $$v$$ if and only if $$u$$ and $$v$$ differ in exactly one bit position (in other words, $$v$$ can be obtained from $$u$$ by flipping a single bit). The ratio of the choromatic number of $$G$$ to the diameter of $$G$$ is

2

GATE CSE 2005

MCQ (Single Correct Answer)

+2

-0.6

Which one of the following graphs is NOT planar?

3

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

The minimum number of colours required to colour the following graph, such that
no two adjacent vertices are assigned the same colour, is

4

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

How many graphs on $$n$$ labeled vertices exist which have at least $$\left( {{n^2} - 3n} \right)/2\,\,\,$$ edges?

Questions Asked from Graph Theory (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (2)
GATE CSE 2021 Set 1 (3)
GATE CSE 2020 (1)
GATE CSE 2015 Set 1 (2)
GATE CSE 2015 Set 2 (2)
GATE CSE 2014 Set 1 (2)
GATE CSE 2014 Set 3 (2)
GATE CSE 2014 Set 2 (1)
GATE CSE 2013 (1)
GATE CSE 2012 (2)
GATE CSE 2010 (1)
GATE CSE 2008 (5)
GATE CSE 2007 (2)
GATE CSE 2006 (3)
GATE CSE 2005 (1)
GATE CSE 2004 (4)
GATE CSE 2003 (2)
GATE CSE 2001 (1)
GATE CSE 1995 (1)
GATE CSE 1992 (1)
GATE CSE 1991 (1)
GATE CSE 1990 (1)
GATE CSE 1989 (1)

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude