1
GATE CSE 2014 Set 1
+1
-0.3
Let $$G = \left( {V,E} \right)$$ be a directed graph where $$V$$ is the set of vertices and $$E$$ the set of edges. Then which one of the following graphs has the same strongly connected components as $$G$$?
A
$${G_1} = \left( {V,\,\,{E_1}} \right)\,\,\,$$where $$\,\,{E_1} = \left\{ {\left( {u,v} \right) \notin E} \right\}$$
B
$${G_2} = \left( {V,\,\,{E_2}} \right)\,\,\,$$ where $$\,\,\,{E_2} = \left\{ {\left( {u,v} \right) \in E} \right\}$$
C
$${G_3} = \left( {V,\,\,{E_3}} \right)\,\,\,$$ where $$\,\,{E_3} =$$ {$${\left( {u,v} \right)\left| \, \right.}$$ there isa path of length $$\le 2$$ from $$u$$ to $$v$$ in $$E$$}
D
$${G_4} = \left( {{V_4},\,\,{E_{}}} \right)\,\,\,$$ where $${{V_4}}$$ is the set of vertices in $$G$$ which are not isolated.
2
GATE CSE 2014 Set 1
Numerical
+1
-0
The maximum number of edges in a bipartite graph on $$12$$ vertices is _________.
3
GATE CSE 2013
+1
-0.3
Consider an undirected random$$^ \circ$$ graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
A
$$1/8$$
B
$$1$$
C
$$7$$
D
$$8$$
4
GATE CSE 2013
+1
-0.3
Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
A
P only
B
Q only
C
Both P and Q
D
Neither P and Q
GATE CSE Subjects
EXAM MAP
Medical
NEET