Counting trees with a small number of vertices

Stablo je povezan jednostavan graf bez ciklusa. Prebrojavanje različitih stabala s n vrhova je težak kombinatorni problem. Za velike vrijednosti n, problem je još uvijek otvoren. U ovom će se članku prebrojiti i konstruirati sva stabla s najviše osam vrhova.A tree is a connected simple graph without cycles. Counting different trees with n vertices is a difficult combinatorial problem. For the large values of n, the problem is still open. In this paper we discuss the numbers and constructions of all trees with up to eight vertices