- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which graph is used to define the claw f...

Q. |
## Which graph is used to define the claw free graph? |

A. | bipartite graph |

B. | claw graph |

C. | star graph |

D. | cartesian graph |

Answer» B. claw graph | |

Explanation: star is a complete bipartite graph with one internal node and k leaves. star with three edges is called a claw. hence this graph is used to define claw free graph. |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- 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?
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
- Which graph cannot contain K3, 3 as a minor of graph?
- Which complete graph is not present in minor of Outer Planar Graph?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
- A graph is found to be 2 colorable. What can be said about that graph?
- What is the chromatic number of compliment of line graph of bipartite graph?

Login to Continue

It will take less than 2 minutes

Report MCQ