1
GATE CSE 2015 Set 1
Numerical
+2
-0
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is ___________.
Your input ____
2
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
If $$G$$ is a forest with $$n$$ vertices and $$k$$ connected components, how many edges does $$G$$ have?
A
$$\left\lfloor {n/k} \right\rfloor $$
B
$$\left\lceil {n/k} \right\rceil \,$$
C
$$n - k$$
D
$$n - k + 1$$
3
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Let $$\delta $$ denote the minimum degree of a vertex in a graph. For all planar graphs on $$n$$ vertices with $$\delta \ge 3$$, which one of the following is TRUE?
A
In any planar embedding, the number of faces is at least $${n \over 2} + 2$$
B
In any planar embedding, the number of faces is less than $${n \over 2} + 2$$
C
There is a planar embedding in which the number of facess is less than $${n \over 2} + 2$$
D
There is a planar embedding in which the number of faces is at most $${n \over {\delta + 1}}$$
4
GATE CSE 2014 Set 2
Numerical
+2
-0
A cycle on $$n$$ vertices is isomorphic to its complement. The value of $$n$$ is __________.
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP