1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
$$G$$ is a graph on $$n$$ vertices and $$2n-2$$ edges. The edges of $$G$$ can be partitioned into two edge-disjoint spanning trees. Which of the following in NOT true for $$G$$?
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
$$G$$ is a simple undirected graph. Some vertices of $$G$$ are of odd degree. Add a node $$v$$ to $$G$$ and make it adjacent to each odd degree vertex of $$G$$. The resultant graph is sure to be
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following statements is true for every planar graph on $$n$$ vertices?
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Let Graph$$(x)$$ be a predicate which denotes that $$x$$ is a graph. Let Connected$$(x)$$ be a predicate which denotes that $$x$$ is connected. Which of the following first order logic sentences DOES NOT represent the statement: $$Not\,\,\,every\,\,\,graph\,\,\,is\,\,\,connected?$$
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 2023 (2)
GATE CSE 2022 (4)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (3)
GATE CSE 2020 (1)
GATE CSE 2019 (1)
GATE CSE 2015 Set 1 (2)
GATE CSE 2015 Set 2 (2)
GATE CSE 2014 Set 3 (2)
GATE CSE 2014 Set 2 (1)
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