1

GATE CSE 2007

MCQ (Single Correct Answer)

+1

-0.3

The maximum number of binary trees that can be formed with three unlabeled nodes is:

2

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

If all the edge weights of an undirected graph are positive, then any subject of edges that connects all the vertices and has minimum total weight is a

3

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

Consider a weighted complete graph $$G$$ on the vertex set $$\left\{ {{v_1},\,\,\,{v_2},....,\,\,\,{v_n}} \right\}$$ such that the weight of the edge $$\left( {{v_i},\,\,\,\,{v_j}} \right)$$ is $$2\left| {i - j} \right|$$. The weight of a minimum spanning tree of $$G$$ is

4

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:

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 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