1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following graphs is NOT planar? GATE CSE 2005 Discrete Mathematics - Graph Theory Question 29 English
A
G1
B
G2
C
G3
D
G4
2
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 GATE CSE 2004 Discrete Mathematics - Graph Theory Question 67 English
A
2
B
3
C
4
D
5
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
What is the number of vertices in an undirected connected graph with $$27$$ edges, $$6$$ vertices of degree $$2$$, $$\,\,$$ $$3$$ vertices of degree 4 and remaining of degree 3?
A
$$10$$
B
$$11$$
C
$$18$$
D
$$19$$
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)$$
A
cannot have a cut vertex
B
must have a cycle
C
must have a cut-edge (bridge)
D
has chromatic number strictly greater than those of $${G_1}$$ and$${G_2}$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP