Two groups are isomorphic if and only if                      is existed between them.

Related MCQs

• At a software company, skilled workers have been hired for a project. Out of 75 candidates, 48 of them were software engineer; 35 of them were hardware engineer; 42 of them were network engineer; 18 of them had skills in all three jobs and all of them had skills in at least one of these jobs. How many candidates were hired who were skilled in exactly 2 jobs?
• How many different non-isomorphic Abelian groups of order 8 are there?
• The graph is the smallest non-modular lattice N5. A lattice is                if and only if it does not have a                isomorphic to N5.
• Every Isomorphic graph must have                  representation.
• A cycle on n vertices is isomorphic to its complement. What is the value of n?
• How many ways are there to divide 4 Indian countries and 4 China countries into 4 groups of 2 each such that at least one group must have only Indian countries?
• The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n>=4. Two vertices of G are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in G can be                        
• Let (A7, ⊗7)=({1, 2, 3, 4, 5, 6}, ⊗7) is a group. It has two sub groups X and Y. X={1, 3, 6}, Y={2, 3, 5}. What is the order of union of subgroups?
• An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if
• An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?