Every Isomorphic graph must have                  representation.

Related MCQs

• The graph is the smallest non-modular lattice N5. A lattice is                if and only if it does not have a                isomorphic to N5.
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• 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            
• A cycle on n vertices is isomorphic to its complement. What is the value of n?
• Two groups are isomorphic if and only if                      is existed between them.
• How many different non-isomorphic Abelian groups of order 8 are there?
• A              is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).
• Berge graph is similar to              due to strong perfect graph theorem.
• 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              
• A path of a graph is said to be ______ if it contains all the edges of the graph.