Berge graph is similar to              due to strong perfect graph theorem.

Related MCQs

• The statement, “At least one of your friends is perfect”. Let P (x) be “x is perfect” and let F (x) be “x is your friend” and let the domain be all people.
• 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            
• A path of a graph is said to be ______ if it contains all the edges of the graph.
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• Lagrange’s theorem specifies                      
• Find the number of factors of the product 58 * 75 * 23 which are perfect squares.
• Which of the following problems is similar to that of a Hamiltonian path problem?
• 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).
• 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?