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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

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.

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

📊 Question Analytics

👁️

710

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

89%

Success Rate