1

GATE CSE 1995

Subjective

+2

-0

Prove that in a finite graph, the number of vertices of odd degree is always even.

2

GATE CSE 1992

Fill in the Blanks

+2

-0

Maximum number of edges in a planar graph with $$n$$ vertices is _______ .

3

GATE CSE 1991

Fill in the Blanks

+2

-0

The maximum number of possible edges in an undirected graph with a vertices and $$k$$ components is _________ .

4

GATE CSE 1990

MCQ (Single Correct Answer)

+2

-0.6

A graph is planar if and only if,

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 2 (2)
GATE CSE 2015 Set 1 (2)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (2)
GATE CSE 2014 Set 1 (2)
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

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