1
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 _________ .
2
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.
3
GATE CSE 1989
Subjective
+2
-0
Which of the following graphs is / are planar? (see fig.) GATE CSE 1989 Discrete Mathematics - Graph Theory Question 30 English
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP