Petrenjuk A. Extremal decompositions of complete graphs: existence and enumeration.

Українська версія

Thesis for the degree of Doctor of Science (DSc)

State registration number

0502U000493

Thesis Registration Form

0502U000493.pdf

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

22-11-2002

Specialized Academic Board

Д 26.194.02

V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine

Essay

The dissertation is devoted to the problems of existence and enumeration, up to isomorfism, of the decompositions of complete graphs. New conditions of the existence of T-factorizations of complete graphs is found, and the existence problem for T-factorizations of order 10 and the existence problem for bicyclic T-factorizations of order 14 are complete solved. The enumeration results for T-factorizations and for decompositions of complete graphs into wheels, stars, mitras, pentagons, delta-factors and cubic graphs are obtained.

Read more

Files

1_TIT.DOC

2_ZMIST.DOC

3_UMPOZ.DOC

4_VSTUP.DOC

REF.DOC

ROZD01.DOC

ROZD02.DOC

ROZD03.DOC

ROZD04.DOC

ROZD05.DOC

ROZD06.DOC

ROZD07.DOC

ROZD08.DOC

ROZD09.DOC

ROZD10.DOC

VISN.DOC

W-LIT.DOC

Similar theses

0421U102388

Nasirov Emil Mekhdiievych

Parallelization of non-negative huge sparse linguistic matrix and tensors factorization

0420U102355

Dudar Vyacheslav Vyacheslavovych

Training algorithms and invariance to geometric transformations of neural networks

0520U101700

Prytomanova Olga M.

Fuzzy problems of optimal set partitioning: theoretical bases, methods and algorithms for solving

0520U100242

Zavadskyi Ihor O.

Splittable codes and their applications

0520U100209

Rystsov Ihor

Application of algebraic automata theory to analysis of discrete dynamical systems.