Premium
Q 5 ‐factorization of λK n
Author(s) -
Doğan Oğuz,
Küçükçifçi Selda,
Yazıcı Emine Ş.
Publication year - 2020
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21704
Subject(s) - combinatorics , mathematics , mod , factorization , tuple , graph , simple graph , discrete mathematics , algorithm
Q k is the simple graph whose vertices are the k ‐tuples with entries in {0, 1} and edges are the pairs of k ‐tuples that differ in exactly one position. In this paper, we proved that there exists a Q 5 ‐factorization of λK n if and only if (a) n ≡ 0(mod 32) if λ ≡ 0(mod 5) and (b) n ≡ 96(mod 160) if λ ≢ 0(mod 5).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom