Автор(и):

Mladen Valkov, Institute of Mathematics and Informatics at the Bulgarian Academy of Sciences, Bulgaria, mladen.vulkov@math.bas.bg; mlado1992@abv.bg; https://strunima.valkovbg.com/

https://doi.org/10.55630/STEM.2025.0732

Абстракт:

    Cycle count in graphs is a commonly investigated property in various types of graphs – in standard education of mathematics and informatics, competitive mathematics and open mathematical problems. The purpose of the developed digital tools in StruniMa is to systemize some of them into interactive educational tutorials and problems in different difficulty levels so they become available to wider range of students.

Ключови думи:

Graphs; Cycles in Graphs; Spanning Tree;

Получена:

19-09-2025

Приета:

16-12-2025

Публикувана:

31-12-2025

Цитиране (APA style):

Valkov, M. (2025). Counting Cycles in Graphs with Strunima, Science Series "Innovative STEM Education", volume 07, ISSN: 2683-1333, Institute of Mathematics and Informatics – Bulgarian Academy of Sciences, pp. 348-353, DOI: https://doi.org/10.55630/STEM.2025.0732

Адрес на PDF файл:

http://www.math.bas.bg/vt/stemedu/books/07/STEM.2025.0732.pdf