Let G be the graph defined as the Hasse diagram for the relation on – McqOptions

MCQOPTIONS

1.	Let G be the graph defined as the Hasse diagram for the relation on the set S{1, 2, , 18}. How many edges are there in G?
A.	43722
B.	2359296
C.	6487535
D.	131963
Answer» C. 6487535

Discussion

No Comment Found

Related MCQs

Let G be the graph defined as the Hasse diagram for the relation on the set S{1, 2, , 18}. How many edges are there in G?
Suppose P<sub>1</sub> is a partially ordered class and a cut of P<sub>1</sub> is pair (D, T) of nonempty subclasses of P<sub>1</sub> satisfies which of the following properties?
In a poset P({v, x, y, z}, ) which of the following is the greatest element?
In a poset (S, ), if there is no element n S with m<n, then which of the following is true?
The relation is a partial order if it is ___________