Embedding handcuffed designs in D-designs, where D is the triangle with attached edge

被引:17
作者
Quattrocchi, G [1 ]
机构
[1] Univ Catania, Dipartimento Matemat & Informat, I-95125 Catania, Italy
关键词
graph design; embedding; path;
D O I
10.1016/S0012-365X(02)00486-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let D be the triangle with attached edge (i.e. D is the graph having vertices {a(0),a(1),a(2),a(3)} and edges {a(0),a(1)}, {a(0),a(2)}, {a(1),a(2)], {a(0),a(3)}). Bermond and Schonheim (Discrete Math. 19 (1977) 113) proved that a D-design of order n exists if and only if n equivalent to 0 or 1 (mod 8). Let (W,C) be a nontrivial D-design of order n, n greater than or equal to 8, and let V subset of W, \V\ = u < n. We say that a handcuffed design (V,P) of order v and block size s (P. Hell, A. Rosa, Discrete Math. 2 (1972) 229 252) is embedded in (W,C) if there is an injective mapping f : P --> C such that B is a subgraph of f (B) for every B is an element of P. For each n equivalent to 0 or 1 (mod 8), we determine the spectrum of all the integers v such that there is a nontrivial handcuffed design of order v and block size s embedded in a D-design of order n. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:413 / 434
页数:22
相关论文
共 5 条
[1]   G-DECOMPOSITION OF KN, WHERE G HAS 4 VERTICES OR LESS [J].
BERMOND, JC ;
SCHONHEIM, J .
DISCRETE MATHEMATICS, 1977, 19 (02) :113-120
[2]  
Colbourn C. J., 1996, The CRC handbook of combinatorial designs
[3]  
Hell P., 1972, DISCRETE MATH, V2, P229
[4]  
HUNG SHY, 1974, AEQUATIONES MATH, V18, P256
[5]   Embedding handcuffed designs with block size 2 or 3 in 4-cycle systems [J].
Milici, S ;
Quattrocchi, G .
DISCRETE MATHEMATICS, 1999, 208 :443-449