1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following graphs is NOT planar?
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
How many graphs on $$n$$ labeled vertices exist which have at least $$\left( {{n^2} - 3n} \right)/2\,\,\,$$ edges?
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The minimum number of colours required to colour the following graph, such that
no two adjacent vertices are assigned the same colour, is


4
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Let $${G_1} = \left( {V,\,{E_1}} \right)$$ and $${G_2} = \left( {V,\,{E_2}} \right)$$ be connected graphs on the same vertex set $$V$$ with more than two vertices. If $${G_1} \cap {G_2} = \left( {V,{E_1} \cap {E_2}} \right)$$ is not a connected graph, then the graph $${G_1} \cup {G_2} = \left( {V,{E_1} \cup {E_2}} \right)$$
GATE CSE Subjects
Browse all chapters by subject
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