1

GATE CSE 2013

MCQ (Single Correct Answer)

+1

-0.3

Consider an undirected random$$^ \circ $$ graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?

2

GATE CSE 2013

MCQ (Single Correct Answer)

+1

-0.3

Which of the following statements is/are TRUE for undirected graphs?

P: Number of odd degree vertices is even.

Q: Sum of degrees of all vertices is even.

P: Number of odd degree vertices is even.

Q: Sum of degrees of all vertices is even.

3

GATE CSE 2012

MCQ (Single Correct Answer)

+1

-0.3

Let G be a simple undirected planner graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

4

GATE CSE 2011

MCQ (Single Correct Answer)

+1

-0.3

$$K4$$ and $$Q3$$ are graphs with the following structures.

Which one of the following statements is **TRUE** in relation to these graphs?

Questions Asked from Graph Theory (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2022 (2)
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