当前位置: X-MOL 学术J. Comb. Des. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Q5‐factorization of λKn
Journal of Combinatorial Designs ( IF 0.7 ) Pub Date : 2020-02-11 , DOI: 10.1002/jcd.21704
Oğuz Doğan 1 , Selda Küçükçifçi 1 , Emine Ş. Yazıcı 1
Affiliation  

Qk 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 Q5‐factorization of λKn if and only if (a) n ≡ 0(mod 32) if λ ≡ 0(mod 5) and (b) n ≡ 96(mod 160) if λ ≢ 0(mod 5).

中文翻译:

λKn的Q5因式分解

Q k是简单图,其顶点是在{0,1}中有条目的k个元组,而边是在一个位置上完全不同的k个元组对。在本文中,我们证明了存在一个Q 5的因子分解λK Ñ当且仅当(a)中Ñ  ≡0(模32),如果λ≡0(MOD 5)和(b)ñ  ≡96(MOD 160)如果λ  ≢0(MOD 5)。
更新日期:2020-02-11
down
wechat
bug