ГРАФОВИЙ МАТРОЇД ТА АНАЛІЗ СПАНУЮЧИХ ДЕРЕВ У ГРАФІ

Inessa Kulakovska

doi:10.30890/2567-5273.2025-40-02-036

GRAPH MATROID AND ANALYSIS OF SLEEPING TREES IN A GRAPH

Authors

Inessa Kulakovska Petro Mohyla Black Sea National University https://orcid.org/0000-0002-8432-1850

DOI:

https://doi.org/10.30890/2567-5273.2025-40-02-036

Keywords:

graph, matroid, spanning tree, Kruskal’s algorithm, graphic matroid, independent sets, combinatorial optimization

Abstract

This study explores the graphic matroid as a formal framework for modeling the construction of spanning trees in undirected graphs. By interpreting acyclic edge subsets as independent sets, the matroid structure provides a rigorous foundation for analyzin

Downloads

Published

2025-08-30

How to Cite

Кулаковська, І. (2025). GRAPH MATROID AND ANALYSIS OF SLEEPING TREES IN A GRAPH. Modern Engineering and Innovative Technologies, 2(40-02), 21–31. https://doi.org/10.30890/2567-5273.2025-40-02-036