<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Q(5)-factorization of lambda K-n

Loading...
Thumbnail Image

Departments

Item type:Organizational Unit,

School / College / Institute

Item type:Organizational Unit,

Program

Organization Authors

Co-Authors

Date

Language

Embargo Status

N/A

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

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 lambda K-n if and only if (a) n equivalent to 0(mod 32) if lambda equivalent to 0(mod 5) and (b) n equivalent to 96(mod 160) if lambda not equivalent to 0(mod 5).

Source

Publisher

John Wiley and Sons Inc.

Citation

item.page.haspartof

Source

Journal of Combinatorial Designs

item.page.ispartofseries

item.page.edition

DOI

10.1002/jcd.21704

item.page.datauri

item.page.link

Rights

N/A

Copyrights Note

Rights and licensing

N/A

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators