McqMate

Q. |
## How many edges does a n vertex triangle free graph contains? |

A. | n2 |

B. | n2 + 2 |

C. | n2 / 4 |

D. | n3 |

Answer» C. n2 / 4 | |

Explanation: a n vertex triangle free graph contains a total of n2 / 4 number of edges. this is stated by mantel’s theorem which is a special case in turan’s theorem for r=2. |

2.6k

0

Do you find this helpful?

43

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
- 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?
- Which graph is used to define the claw free graph?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- The problem of finding a path in a graph that visits every vertex exactly once is called?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?