Q. Which type of graph has all the vertex of the first set connected to all the vertex of the second set?

  • (A) bipartite
  • (B) complete bipartite
  • (C) cartesian
  • (D) pie
💬 Discuss
✅ Correct Answer: (B) complete bipartite
Explanation: the graph is known as bipartite if the graph does not contain any odd length cycle in it. the complete bipartite graph has all the vertex of first set connected to all the vertex of second set.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
the graph is known as bipartite if the graph does not contain any odd length cycle in it. the complete bipartite graph has all the vertex of first set connected to all the vertex of second set.

💬 Discussion

Related MCQs

Q. If the state of the database no longer reflects a real state of the world that the database is supposed to capture, then such a state is called

Q. Error guessing is a

Q. The full form of EEPROM is

Q. It is not an application of e-business.

Q. A complete n-node graph Kn is planar if and only if

Q. Which scheme/ strategy is suitable to establish the communication between the access point (AP) and the infrastructure of LANs?

Q. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised

Q. it --- x means

Q. In AE analysis revenues must cover two kinds of costs:– Operating costs and Capital recovery costs

Q. The biological neuron's__________is a continuous function rather than a step function.

📊 Question Analytics

👁️
756
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
87%
Success Rate