1
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Suppose L = { p, q, r, s, t } is a lattice represented by the following Hasse diagram: GATE CSE 2015 Set 1 Discrete Mathematics - Graph Theory Question 19 English For any $$x, y ∈ L$$, not necessarily distinct, $$x ∨ y$$ and x ∧ y are join and meet of x, y, respectively. Let $$L^3 = \left\{\left(x, y, z\right): x, y, z ∈ L\right\}$$ be the set of all ordered triplets of the elements of L. Let pr be the probability that an element $$\left(x, y,z\right) ∈ L^3$$ chosen equiprobably satisfies $$x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z)$$. Then
A
pr = 0
B
pr = 1
C
$$0 < p_r ≤ \frac{1}{5}$$
D
$$\frac{1}{5} < p_r < 1$$
2
GATE CSE 2015 Set 1
Numerical
+2
-0
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is ___________.
Your input ____
3
GATE CSE 2014 Set 2
Numerical
+2
-0
A cycle on $$n$$ vertices is isomorphic to its complement. The value of $$n$$ is __________.
Your input ____
4
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Let $$\delta $$ denote the minimum degree of a vertex in a graph. For all planar graphs on $$n$$ vertices with $$\delta \ge 3$$, which one of the following is TRUE?
A
In any planar embedding, the number of faces is at least $${n \over 2} + 2$$
B
In any planar embedding, the number of faces is less than $${n \over 2} + 2$$
C
There is a planar embedding in which the number of facess is less than $${n \over 2} + 2$$
D
There is a planar embedding in which the number of faces is at most $${n \over {\delta + 1}}$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSAT
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN