Protasova K. Partitions of Graphs

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

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0406U001408

Thesis Registration Form

0406U001408.pdf

Applicant for

Specialization

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

24-03-2006

Specialized Academic Board

Д 26.194.02

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

Essay

A new notion of kaleidoscopic graph that is the natural generalization of Hamming codes was introduced here. Two general methods for construction kaleidoscopic graphs based on Kelly graph of groups were described. Several sufficient conditions of square-Hamiltonian graphs were discovered. Key words: balanced partitions of graphs, square-Hamiltonian graphs, kaleidoscopic graphs, gr-graphs, round-about graph.

Read more

Files

Ozn.pdf

Par2.pdf

Par3.pdf

Par4.pdf

Par5.pdf

Par6.pdf

Par7.pdf

Tituln_str.doc

Vstup.pdf

aref.doc

p1.pdf

В И С Н О В К И.doc

Список використаних джерел.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.