aof.sorular.net
Mathematics 2
Mathematics 2 Deneme Sınavı
Mathematics 2 Deneme Sınavı Sorusu #487243
Mathematics 2 Deneme Sınavı Sorusu #487243
How many different trees are there with 4 edges?
|
3 |
|
4 |
|
16 |
|
32 |
|
64 |
Yanıt Açıklaması:
A tree is a graph which is connected and contains no cycles. Every tree on n vertices has exactly n-1 edges and the number of labelled trees on n vertices is
by Cayley’s theorem. Now if we write n=4, we get 4^2=16. The correct answer is C.
Yorumlar
- 0 Yorum