1

GATE CSE 2015 Set 1

Numerical

+2

-0

Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is ___________.

Your input ____

2

GATE CSE 2014 Set 2

Numerical

+2

-0

A cycle on $$n$$ vertices is isomorphic to its complement. The value of $$n$$ is __________.

Your input ____

3

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

+2

-0.6

Let $$\delta $$ denote the minimum degree of a vertex in a graph. For all planar graphs on $$n$$ vertices with $$\delta \ge 3$$, which one of the following is TRUE?

4

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

+2

-0.6

If $$G$$ is a forest with $$n$$ vertices and $$k$$ connected components, how many edges does $$G$$ have?

Questions Asked from Graph Theory (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

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

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