Which term defines all the complete bipartite graph that are trees?

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Design and Analysis of Algorithms

Q. Which term defines all the complete bipartite graph that are trees?

(A) symmetric
(B) anti – symmetric
(C) circular
(D) stars

💬 Discuss

✅ Correct Answer: (D) stars

Explanation: star is a complete bipartite graph with one internal node and k leaves. therefore, all complete bipartite graph which is trees are known as stars in graph theory.

Explanation by: Mr. Dubey

star is a complete bipartite graph with one internal node and k leaves. therefore, all complete bipartite graph which is trees are known as stars in graph theory.

💬 Discussion

📊 Question Analytics

👁️

979

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

92%

Success Rate