2 Citations (Scopus)

Abstract

Direct and recursive constructions are established for graph designs for K2 × K6 grid-blocks. Using these, the existence of graph designs of index one in which the blocks are K2 × K6 grid-blocks is completely determined: A (K2 × K6)-design of order v exists if and only if v ≡ 1 (mod 72).

Original languageEnglish (US)
Pages (from-to)1557-1567
Number of pages11
JournalGraphs and Combinatorics
Volume29
Issue number5
DOIs
StatePublished - Sep 2013

Fingerprint

Graph Design
Grid
If and only if
Design

Keywords

  • Balanced incomplete block design
  • Graph design
  • Grid design
  • Group divisible design
  • Pairwise balanced design

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

The Existence of (K2 × K6)-Designs. / Wang, Chengmin; Colbourn, Charles.

In: Graphs and Combinatorics, Vol. 29, No. 5, 09.2013, p. 1557-1567.

Research output: Contribution to journalArticle

Wang, Chengmin ; Colbourn, Charles. / The Existence of (K2 × K6)-Designs. In: Graphs and Combinatorics. 2013 ; Vol. 29, No. 5. pp. 1557-1567.
@article{c66b28d109b641c190da1ebd2d97f412,
title = "The Existence of (K2 × K6)-Designs",
abstract = "Direct and recursive constructions are established for graph designs for K2 × K6 grid-blocks. Using these, the existence of graph designs of index one in which the blocks are K2 × K6 grid-blocks is completely determined: A (K2 × K6)-design of order v exists if and only if v ≡ 1 (mod 72).",
keywords = "Balanced incomplete block design, Graph design, Grid design, Group divisible design, Pairwise balanced design",
author = "Chengmin Wang and Charles Colbourn",
year = "2013",
month = "9",
doi = "10.1007/s00373-012-1187-6",
language = "English (US)",
volume = "29",
pages = "1557--1567",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "5",

}

TY - JOUR

T1 - The Existence of (K2 × K6)-Designs

AU - Wang, Chengmin

AU - Colbourn, Charles

PY - 2013/9

Y1 - 2013/9

N2 - Direct and recursive constructions are established for graph designs for K2 × K6 grid-blocks. Using these, the existence of graph designs of index one in which the blocks are K2 × K6 grid-blocks is completely determined: A (K2 × K6)-design of order v exists if and only if v ≡ 1 (mod 72).

AB - Direct and recursive constructions are established for graph designs for K2 × K6 grid-blocks. Using these, the existence of graph designs of index one in which the blocks are K2 × K6 grid-blocks is completely determined: A (K2 × K6)-design of order v exists if and only if v ≡ 1 (mod 72).

KW - Balanced incomplete block design

KW - Graph design

KW - Grid design

KW - Group divisible design

KW - Pairwise balanced design

UR - http://www.scopus.com/inward/record.url?scp=84882874545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84882874545&partnerID=8YFLogxK

U2 - 10.1007/s00373-012-1187-6

DO - 10.1007/s00373-012-1187-6

M3 - Article

AN - SCOPUS:84882874545

VL - 29

SP - 1557

EP - 1567

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 5

ER -