1

GATE CSE 2021 Set 2

MCQ (Single Correct Answer)

+1

-0.33

Let G be a connected undirected weighted graph. Consider the following two statements.

S_{1}: There exists a minimum weight edge in G which is present in every minimum spanning tree of G.

S_{2}: If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?

2

GATE CSE 2019

MCQ (Single Correct Answer)

+1

-0.33

Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to

3

GATE CSE 2018

Numerical

+1

-0

Let $$G$$ be a finite group on $$84$$ elements. The size of a largest possible proper subgroup of $$G$$ is ________.

Your input ____

4

GATE CSE 2018

Numerical

+1

-0

The chromatic number of the following graph is _______.

Your input ____

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

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