Embedding path designs into kite systems

Charles Colbourn, Alan C H Ling, Gaetano Quattrocchi

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Let D be the triangle with an attached edge (i.e. D is the "kite", a graph having vertices {a0,a1,a2,a3} and edges {a0,a1}, {a0,a2}, {a1,a2}, {a0,a3}). Bermond and Schönheim [G-decomposition of Kn, where G has four vertices or less, Discrete Math. 19 (1977) 113-120] proved that a kite-design of order n exists if and only if n≡0or1(mod8). Let (W,C) be a nontrivial kite-design of order n≥8, and let V⊂W with |V|=v<n. A path design (V,P) of order v and block size s is embedded into (W,C) if there is an injective mapping f:P→C such that B is an induced subgraph of f(B) for every B∈P. For each n≡0or1(mod8), we determine the spectrum of all integers v such that there is a nontrivial path design of order v and block size 3 embedded into a kite-design of order n.

Original languageEnglish (US)
Pages (from-to)38-48
Number of pages11
JournalDiscrete Mathematics
Volume297
Issue number1-3
DOIs
StatePublished - Jul 28 2005

Fingerprint

Strombus or kite or diamond
Path
Induced Subgraph
Injective
Triangle
Design
If and only if
Decomposition
Decompose
Integer
Graph in graph theory

Keywords

  • Embedding
  • Graph design
  • Path

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Embedding path designs into kite systems. / Colbourn, Charles; Ling, Alan C H; Quattrocchi, Gaetano.

In: Discrete Mathematics, Vol. 297, No. 1-3, 28.07.2005, p. 38-48.

Research output: Contribution to journalArticle

Colbourn, Charles ; Ling, Alan C H ; Quattrocchi, Gaetano. / Embedding path designs into kite systems. In: Discrete Mathematics. 2005 ; Vol. 297, No. 1-3. pp. 38-48.
@article{fb91d96ea2284e8fa00fc89e29d844d7,
title = "Embedding path designs into kite systems",
abstract = "Let D be the triangle with an attached edge (i.e. D is the {"}kite{"}, a graph having vertices {a0,a1,a2,a3} and edges {a0,a1}, {a0,a2}, {a1,a2}, {a0,a3}). Bermond and Sch{\"o}nheim [G-decomposition of Kn, where G has four vertices or less, Discrete Math. 19 (1977) 113-120] proved that a kite-design of order n exists if and only if n≡0or1(mod8). Let (W,C) be a nontrivial kite-design of order n≥8, and let V⊂W with |V|=v",
keywords = "Embedding, Graph design, Path",
author = "Charles Colbourn and Ling, {Alan C H} and Gaetano Quattrocchi",
year = "2005",
month = "7",
day = "28",
doi = "10.1016/j.disc.2005.04.014",
language = "English (US)",
volume = "297",
pages = "38--48",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Embedding path designs into kite systems

AU - Colbourn, Charles

AU - Ling, Alan C H

AU - Quattrocchi, Gaetano

PY - 2005/7/28

Y1 - 2005/7/28

N2 - Let D be the triangle with an attached edge (i.e. D is the "kite", a graph having vertices {a0,a1,a2,a3} and edges {a0,a1}, {a0,a2}, {a1,a2}, {a0,a3}). Bermond and Schönheim [G-decomposition of Kn, where G has four vertices or less, Discrete Math. 19 (1977) 113-120] proved that a kite-design of order n exists if and only if n≡0or1(mod8). Let (W,C) be a nontrivial kite-design of order n≥8, and let V⊂W with |V|=v

AB - Let D be the triangle with an attached edge (i.e. D is the "kite", a graph having vertices {a0,a1,a2,a3} and edges {a0,a1}, {a0,a2}, {a1,a2}, {a0,a3}). Bermond and Schönheim [G-decomposition of Kn, where G has four vertices or less, Discrete Math. 19 (1977) 113-120] proved that a kite-design of order n exists if and only if n≡0or1(mod8). Let (W,C) be a nontrivial kite-design of order n≥8, and let V⊂W with |V|=v

KW - Embedding

KW - Graph design

KW - Path

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

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

U2 - 10.1016/j.disc.2005.04.014

DO - 10.1016/j.disc.2005.04.014

M3 - Article

AN - SCOPUS:23644451163

VL - 297

SP - 38

EP - 48

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -