The graph is the smallest non-modular lattice N5. A lattice is                if and only if it does not have a                isomorphic to N5.

Related MCQs

• Every Isomorphic graph must have                  representation.
• Two groups are isomorphic if and only if                      is existed between them.
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• If each non-empty subset of a lattice has a least upper bound and greatest lower bound then the lattice is called ________.
• A cycle on n vertices is isomorphic to its complement. What is the value of n?
• How many different non-isomorphic Abelian groups of order 8 are there?
• A graph is              if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.
• A graph is planar if and only if it does not contain ________.
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and