1
GATE CSE 2005
+1
-0.3
Let $$G$$ be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the graph is:
A
6
B
8
C
9
D
13
2
GATE CSE 2005
+1
-0.3
Let $$G$$ be the simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of $$G$$ is 8. Then, the size of the maximum independent set of $$G$$ is:
A
12
B
8
C
Less than 8
D
More than 12
3
GATE CSE 2004
+1
-0.3
What is the maximum number of edges in an acyclic undirected graph with $$n$$ vertices?
A
$$n-1$$
B
$$n$$
C
$$n + 1$$
D
$$2n-2$$
4
GATE CSE 2003
+1
-0.3
Let $$G$$ be an arbitrary graph with $$n$$ nodes and $$k$$ components. If a vertex is removed from $$G$$, the number of components in the resultant graph must necessarily lie between
A
$$k$$ and $$n$$
B
$$k - 1$$ and $$k + 1$$
C
$$k - 1$$ and $$n - 1$$
D
$$k + 1$$ and $$n -k$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization
EXAM MAP
Joint Entrance Examination