20.500.12556/DKUM-88848 Linear algorithms for the Hosoya index and Hosoya matrix of a tree The Hosoya index of a graph is defined as the total number of its independent edge sets. This index is an important example of topological indices, a molecular-graph based structure descriptor that is of significant interest in combinatorial chemistry. The Hosoya index inspires the introduction of a matrix associated with a molecular acyclic graph called the Hosoya matrix. We propose a simple linear-time algorithm, which does not require pre-processing, to compute the Hosoya index of an arbitrary tree. A similar approach allows us to show that the Hosoya matrix can be computed in constant time per entry of the matrix. Hosoya index Hosoya matrix optimal algorithm Hosoyev indeks Hosoyeva matrika optimalni algoritmi true false true MDPI Angleški jezik Slovenski jezik Znanstveno delo 2024-05-30 03:29:20 2024-10-18 13:59:57 2024-10-19 03:11:37 0000-00-00 00:00:00 2021 0 0 Str. 1-11 št. 2, št. članka 142 Letn. 9 2021 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2020-11-03 2021-01-08 2021-01-11 519.17 46938627 10.3390/math9020142 2227-7390 Vesel-2021-Linear_Algorithms_for_the_Hosoya_In.pdf Vesel-2021-Linear_Algorithms_for_the_Hosoya_In.pdf 1 4DBC0E336BA242C2DD555DC2E4871FBD 71d73b72f93f43bf97234be99078651bbce36ec23b25fdae678e0b5d73931939 6cd08a8d-8d48-11ef-a8b7-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=186665 https://doi.org/10.3390/math9020142 1 0b425edc-1e24-11ef-9a97-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=179906 Fakulteta za naravoslovje in matematiko 0 0 0