McqMate

Q. |
## Every Perfect graph has forbidden graph characterization. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: berge theorem proves the forbidden graph characterization of every perfect graphs. because of that reason every bipartite graph is perfect graph. |

2.9k

0

Do you find this helpful?

31

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- Is every complete bipartite graph a Moore Graph.
- Is it true that every complete bipartite graph is a modular graph.
- Which of the following is not a property of perfect graph?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- Every graph has only one minimum spanning tree.
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
- A graph is found to be 2 colorable. What can be said about that graph?