Stručni rad

Counting trees with a small number of vertices

Ivan Mihovilović orcid.org/0000-0003-1977-6549 ; Fakultet elektrotehnike i računarstva, Sveučilište u Zagrebu, Zagreb
Anamari Nakić ; Fakultet elektrotehnike i računarstva, Sveučilište u Zagrebu, Zagreb

Sažetak

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.

Ključne riječi

graph, tree, counting of trees

Hrčak ID:

276230

URI

https://hrcak.srce.hr/276230

Datum izdavanja:

17.3.2022.

Podaci na drugim jezicima: hrvatski

Posjeta: 784 *