Neighbor designs and m-wheel systems

Charles Colbourn, C. C. Lindner, C. A. Rodger

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper we find the values of n for which there exists a regular decomposition of Kn and of 2Kn into edge disjoint copies of the wheel Wm, m odd, with some exceptions for each value of m.

Original languageEnglish (US)
Pages (from-to)335-340
Number of pages6
JournalJournal of Statistical Planning and Inference
Volume27
Issue number3
DOIs
StatePublished - 1991
Externally publishedYes

Fingerprint

Wheel
Exception
Wheels
Disjoint
Odd
Decomposition
Decompose
Design

Keywords

  • cycles
  • Neighbor designs
  • wheels

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics

Cite this

Neighbor designs and m-wheel systems. / Colbourn, Charles; Lindner, C. C.; Rodger, C. A.

In: Journal of Statistical Planning and Inference, Vol. 27, No. 3, 1991, p. 335-340.

Research output: Contribution to journalArticle

Colbourn, Charles ; Lindner, C. C. ; Rodger, C. A. / Neighbor designs and m-wheel systems. In: Journal of Statistical Planning and Inference. 1991 ; Vol. 27, No. 3. pp. 335-340.
@article{0e8c1f2488544215bd92e65bfc6318a5,
title = "Neighbor designs and m-wheel systems",
abstract = "In this paper we find the values of n for which there exists a regular decomposition of Kn and of 2Kn into edge disjoint copies of the wheel Wm, m odd, with some exceptions for each value of m.",
keywords = "cycles, Neighbor designs, wheels",
author = "Charles Colbourn and Lindner, {C. C.} and Rodger, {C. A.}",
year = "1991",
doi = "10.1016/0378-3758(91)90046-H",
language = "English (US)",
volume = "27",
pages = "335--340",
journal = "Journal of Statistical Planning and Inference",
issn = "0378-3758",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Neighbor designs and m-wheel systems

AU - Colbourn, Charles

AU - Lindner, C. C.

AU - Rodger, C. A.

PY - 1991

Y1 - 1991

N2 - In this paper we find the values of n for which there exists a regular decomposition of Kn and of 2Kn into edge disjoint copies of the wheel Wm, m odd, with some exceptions for each value of m.

AB - In this paper we find the values of n for which there exists a regular decomposition of Kn and of 2Kn into edge disjoint copies of the wheel Wm, m odd, with some exceptions for each value of m.

KW - cycles

KW - Neighbor designs

KW - wheels

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

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

U2 - 10.1016/0378-3758(91)90046-H

DO - 10.1016/0378-3758(91)90046-H

M3 - Article

AN - SCOPUS:2942654270

VL - 27

SP - 335

EP - 340

JO - Journal of Statistical Planning and Inference

JF - Journal of Statistical Planning and Inference

SN - 0378-3758

IS - 3

ER -