Bissoy.com
Doctors Medicines MCQs Q&A

For unrooted trees, the number of unrooted tree topologies (NU) is ________

For unrooted trees, the number of unrooted tree topologies (NU) is ________ Correct Answer NU = (2n− 5)!/2n−3(n− 3)!

The number of possible topologies increases extremely rapidly with the number of taxa. For six taxa, there are 105 unrooted trees and 945 rooted trees. If there are ten taxa, there can be 2,027,025 unrooted trees and 34,459,425 rooted ones.

Related Questions

One-sixth of the trees in a garden are neem trees. Half of the trees are Ashoka trees and the remaining are eucalyptus trees. If the number of neem trees is five, then how many eucalyptus trees are there in the garden?
One-sixth of the trees in a garden are jamun trees, half of the trees are Eucalyptus trees and the remaining are peepal trees.  If the number of jamun trees is 6, how many peepal tree are there in the garden? 
There is a statement followed by two conclusions. Decide which conclusion logically follows from the given statement (s). Statement: A garden has mango, teak, neem, orange, coconut and many trees. The mango tree is 7 meters tall, the orange tree is half of its height and the coconut tree is three times the height of the mango tree. Conclusion: I. The average height of the three trees is less than 10 meters. II. The tallest tree in the garden is the coconut tree. Choose the correct option from the following. A. Only (I) follows. B. Only (II) follows. C. (I) and (II) both follow. D. Neither (I) nor (II) follows.
Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode {              treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) {              int value=0;              if (tree != NULL) {              if (tree->leftMostChild == NULL)              value = 1;    else               value = DoSomething(tree->leftMostChild);               value = value + DoSomething(tree->rightSibling);     }               return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the 
A gardener has to plant trees in rows containing equal number of trees. If he plants in rows of 6, 8, 10 or 12 then five trees are left unplanted. But if he plants in rows of 13 trees each, then no tree is left. What is the number of trees that the gardener plants ?
Consider the with different types of trees. Sohan has different types of trees in the field which are given in the table below: Names of trees Number of trees Neem ||| Papaya |||| Mango |||| || Coconut |||| Guava ||| Using the table, answer the question Neem, Papaya and Mango trees together is how many more than Coconut and Guava trees together?
There are 50 lemon trees in a reclaimed mine area. Each tree produces 800 lemons per year. For each additional tree planted in this area, considering all trees, the output number of fruits per tree drops by 10 lemons in a year. The number of trees that to be added to the existing reclaimed area in order to maximise the total number of lemons in the year is
A number of trees are arranged in 3 rows such that the number of trees in each row is co-prime and the product of the number of trees in first two rows is 551 and the product of the number of trees in last two rows is 1073. How many trees were there in the garden?
A forester wants to plant 44 apples tree, 66 banana trees and 110 mango trees in equal rows (in terms of number of trees). Also, he wants to make distinct rows of tree (i.e. only one type of tree in one row). The number of rows (minimum) that required is:
Which of the following statements regarding tree are correct? (A) All the links of a tree together does not constitute the complement of the corresponding tree (B) A connected subgraph of a connected graph is a tree if there exist (n - 1) nodes of the group (C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it (D) The number of terminal nodes of end vertices of every tree are atleast two (E) Every connected graph has atleast one tree Choose the correct answer from the options given below: (1) (A) and (B) only (2) (B) and (C) only (3) (B) and (D) only (4) (D) and (E) only