1
GATE CSE 1995
Subjective
+2
-0
Prove that in a finite graph, the number of vertices of odd degree is always even.
2
GATE CSE 1992
Fill in the Blanks
+2
-0
Maximum number of edges in a planar graph with $$n$$ vertices is _______ .
3
GATE CSE 1991
Fill in the Blanks
+2
-0
The maximum number of possible edges in an undirected graph with a vertices and $$k$$ components is _________ .
4
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
A graph is planar if and only if,
A
it does not contain subgraphs homeomorphic to K5 and K3, 3.
B
it does not contain subgraphs isomorphic to K5 or K3, 3.
C
it does not contain subgraphs isomorphic to K5 and K3, 3.
D
it does not contain subgraphs homeomorphic to K5 or K3, 3.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP