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

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
Which term defines all the complete bipa...

Q.	Which term defines all the complete bipartite graph that are trees?
A.	symmetric
B.	anti – symmetric
C.	circular
D.	stars
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.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

What is testing of a complete bipartite subgraph in a bipartite graph problem called?
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?
How many spanning trees does a complete bipartite graph contain?
Is every complete bipartite graph a Moore Graph.
Is it true that every complete bipartite graph is a modular graph.
Consider a complete graph G with 4 vertices. The graph G has spanning trees.
What is the chromatic number of compliment of line graph of bipartite graph?
What is the clique size of the line graph of bipartite graph?
From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
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?