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.

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

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

Related MCQs

Q. ---------------- is used to retrieve tuples from the relation.

Q. Regarding paper prototypes:

Q. When is the user controls code is executed

Q. AUB = (A− B)U(B−A)U(AΠΏB).

Q. which sets are equal ? 1.{r,s,t} 2.{s,s,t,r} 3.{t,r,t,s}

Q. Executing the ‘cd ..’ command when at the root level causes

Q. Which of the following FM demodulator is sometimes known as pulse averaging discriminator?

Q. -------------is a unit that is part of a larger system that means a larger system divided into subparts the subpart is known as --------------

Q. RAYMOND'S TREE BASED ALGORITHM is an

Q. The File Transfer Protocol is built on __________

πŸ“Š Question Analytics

πŸ‘οΈ
997
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
96%
Success Rate