Mathematics 2 Deneme Sınavı Sorusu #487243

How many different trees are there with 4 edges?

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.

PAYLAŞ:

SORUNUN CEVABI: C

Sınava Dön Hata Bildir

Yorumlar

0 Yorum