1
GATE CSE 2003
MCQ (Single Correct Answer)
+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$$
2
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Maximum number of edges in a n - node undirected graph without self loops is
A
$${n^2}$$
B
$$n\left( {n - 1} \right)/2$$
C
$$n - 1$$
D
$$\left( {n + 1} \right)\left( n \right)/2$$
3
GATE CSE 1994
MCQ (Single Correct Answer)
+1
-0.3
The number of distinct simple graph with upto three nodes is
A
15
B
10
C
7
D
9
4
GATE CSE 1992
MCQ (Single Correct Answer)
+1
-0.3
A non-planar graph with minimum number of vertices has
A
9 edges, 6 vertices
B
6 edges, 4 vertices
C
10 edges, 5 vertices
D
9 edges, 5 vertices
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12