ДЕЯКІ ВИПАДКИ ПОБУДОВИ БІЦИКЛІЧНОЇ Т-ФАКТОРИЗАЦІЇ ГРАФІВ Кn, ДЕ n=4l+2 ТА l≥1, МЕТОДОМ ПАРАЛЬНОГО ПЕРЕНЕСЕННЯ МІЖДОЛЬОВОГО РЕБРА

Oksana Myronenko; Oksana Myronenko

doi:10.30888/2663-5712.2025-34-01-116

SOME CASES OF CONSTRUCTING BICYCLIC T-FACTORIZATION OF GRAPHS Kn, n=4l+2, l≥1 BY THE METHOD OF PARALLEL TRANSFER OF INTERLOBAL EDGE

Authors

Oksana Myronenko Robert Elworthy Institute of Economics and Technology https://orcid.org/0000-0001-8967-0171

DOI:

https://doi.org/10.30888/2663-5712.2025-34-01-116

Keywords:

complete graph, bicyclic T-factorization, parallel transfer of an interlobular edge of a graph.

Abstract

The work is devoted to the bicyclic T-factorization of the complete graph Kn, where n = 4l+2 and l≥1, and to the algorithm and method of parallel interlobular edge transfer when constructing such basic components of the bicyclic T-factorization. It has b

Downloads

Published

2025-11-30

How to Cite

Мироненко, О. (2025). SOME CASES OF CONSTRUCTING BICYCLIC T-FACTORIZATION OF GRAPHS Kn, n=4l+2, l≥1 BY THE METHOD OF PARALLEL TRANSFER OF INTERLOBAL EDGE. SWorldJournal, 1(34-01), 222–229. https://doi.org/10.30888/2663-5712.2025-34-01-116