Berge graph is similar to ______ due to strong perfect graph theorem. – McqOptions

MCQOPTIONS

1.	Berge graph is similar to ______ due to strong perfect graph theorem.
A.	line graph
B.	perfect graph
C.	bar graph
D.	triangle free graph
Answer» C. bar graph

Discussion

No Comment Found

Related MCQs

The number of edges in a regular graph of degree 46 and 8 vertices is ____________
If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges.
In a ______ the vertex set and the edge set are finite sets.
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.
Triangle free graphs have the property of clique number is __________
If each and every vertex in G has degree at most 23 then G can have a vertex colouring of __________
In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be ______