Реферат: It is shown that for all admissible n ≥ 15 there exists a nonlinear binary 1-perfect code of length n whose minimum distance graph contains at least 7(n + 1)/16 pairwise edge-disjoint Hamiltonian cycles. It is also shown that for all admissible n ≥ 15 the minimum distance graph of the binary Hamming code of length n contains at least 7(n+ 1)/16 pairwise edge-disjoint Hamiltonian cycles.

Библиографическая ссылка: Romanov A.M.
Disjoint hamiltonian cycles in minimum distance graphs of 1-perfect codes
Australasian Journal of Combinatorics. 2017. V.69. N2. P.215-221. Scopus

Идентификаторы БД:

Scopus:

2-s2.0-85029672191

Цитирование в БД:

БД	Цитирований
Scopus	1