1
GATE CSE 2012
MCQ (Single Correct Answer)
+2
-0.6
Let $$G$$ be a complete undirected graph on $$6$$ vertices. If vertices of $$G$$ $$\,\,\,\,$$ are labeled, then the number of distinct cycles of length $$4$$ in $$G$$ is equal to
A
$$15$$
B
$$30$$
C
$$90$$
D
$$360$$
2
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
Let G be a simple undirected planner graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
A
3
B
4
C
5
D
6
3
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
Let $$A$$ be the $$2 \times 2$$ matrix with elements $${a_{11}} = {a_{12}} = {a_{21}} = + 1$$ and $${a_{22}} = - 1$$. Then the eigen values of the matrix $${A^{19}}$$ are
A
$$1024$$ and $$-1024$$
B
$$1024\sqrt 2 \,i$$ and $$ - 1024\sqrt 2 $$
C
$$4\sqrt 2 $$ and $$-4\sqrt 2 $$
D
$$512\sqrt 2 $$ and $$-512\sqrt 2 $$
4
GATE CSE 2012
MCQ (Single Correct Answer)
+2
-0.6
Which of the following graphs is isomorphic to GATE CSE 2012 Discrete Mathematics - Graph Theory Question 69 English
A
GATE CSE 2012 Discrete Mathematics - Graph Theory Question 69 English Option 1
B
GATE CSE 2012 Discrete Mathematics - Graph Theory Question 69 English Option 2
C
GATE CSE 2012 Discrete Mathematics - Graph Theory Question 69 English Option 3
D
GATE CSE 2012 Discrete Mathematics - Graph Theory Question 69 English Option 4