Neighbor designs and m-wheel systems

Charles J. Colbourn; C. C. Lindner; C. A. Rodger

doi:10.1016/0378-3758(91)90046-H

Neighbor designs and m-wheel systems

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

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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

Original language	English (US)
Pages (from-to)	335-340
Number of pages	6
Journal	Journal of Statistical Planning and Inference
Volume	27
Issue number	3
DOIs	https://doi.org/10.1016/0378-3758(91)90046-H
State	Published - Mar 1991
Externally published	Yes

Keywords

Neighbor designs
cycles
wheels

ASJC Scopus subject areas

Statistics and Probability
Statistics, Probability and Uncertainty
Applied Mathematics

Access to Document

10.1016/0378-3758(91)90046-H

Cite this

@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 = "Neighbor designs, cycles, wheels",

author = "Colbourn, {Charles J.} and Lindner, {C. C.} and Rodger, {C. A.}",

year = "1991",

month = mar,

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 J.

AU - Lindner, C. C.

AU - Rodger, C. A.

PY - 1991/3

Y1 - 1991/3

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 - Neighbor designs

KW - cycles

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

SN - 0378-3758

VL - 27

SP - 335

EP - 340

JO - Journal of Statistical Planning and Inference

JF - Journal of Statistical Planning and Inference

IS - 3

ER -

Neighbor designs and m-wheel systems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this