Disjoint hamiltonian cycles in minimum distance graphs of 1-perfect codes

Disjoint hamiltonian cycles in minimum distance graphs of 1-perfect codes Full article

Journal

Australasian Journal of Combinatorics
ISSN: 1034-4942 , E-ISSN: 2202-3518

Output data

Year: 2017, Volume: 69, Number: 2, Pages: 215-221 Pages count : 7

Authors

Romanov A.M. ¹

Affiliations

1	Sobolev Institute of Mathematics, Novosibirsk, 630090, Russian Federation

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

DB	Citing
Scopus	1