1

GATE CSE 2018

Numerical

+1

-0

The chromatic number of the following graph is _______.

Your input ____

2

GATE CSE 2016 Set 2

Numerical

+1

-0

The minimum number of colours that is sufficient to vertex-colour any planar graph is _____________ .

Your input ____

3

GATE CSE 2014 Set 3

Numerical

+1

-0

let $$G$$ be a group with $$15$$ elements. Let $$L$$ be a subgroup of $$G$$. It is known that $$L \ne G$$ and that the size of $$L$$ is at least $$4$$. The size of $$L$$ is ______.

Your input ____

4

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

+1

-0.3

Let $$G = \left( {V,E} \right)$$ be a directed graph where $$V$$ is the set of vertices and $$E$$ the set of edges. Then which one of the following graphs has the same strongly connected components as $$G$$?

Questions Asked from Graph Theory (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2022 (6)
GATE CSE 2021 Set 2 (1)
GATE CSE 2019 (1)
GATE CSE 2018 (2)
GATE CSE 2016 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (2)
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

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