QUESTION 15 In a rooted tree There is a unique path between any two vertices The

Question

QUESTION 15 In a rooted tree There is a unique path between any two vertices The ancestors of any vertex will include at least one leat Every vertex will have at least one descendent The intersection of the ancestors and descendents of a vertex e will be ( QUESTION 16 A network administrator is having trouble with a network. Some links are down and some computers don't seem to be able to communicate to each other. The administrator has determined that the spanning tree finding algorithm has failed. The network administrator has modeled the network as a graph where the vertices are computers and routers, and edges represent physicall neswork links which are currently up tworking A reasonable explanation for the situation in terms of graph theory is The algorihm has produced a spanning tree with too many cycles The spanning tree algorithm was not able to find any cycles The graph is disconnected Some vertices in the graph are too distant from others to form the spanning tree.

Explanation / Answer

problem1:

the rooted tree is defined as a tree in which one vertex has been designated as the root and every edge is directed away from the root

but the every vertex has a atleast one descendants this condition is correct fromm the given statements

problem 2:

the problem is converted to he graph then that problem will be noted as a some vertices in the graph are too distant from others to from the spanning tree

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.