A Note on Decomposition of Tensor Product of Complete Multipartite Graphs into Gregarious Kite

被引：0

作者：

Elakkiya, A. Tamil ^{[1
]}

机构：

[1] Gobi Arts & Science College, Gobichettipalayam, Tamil Nadu, Erode

来源：

Journal of Combinatorial Mathematics and Combinatorial Computing | 2024年 / 120卷

关键词：

Decomposition; Kite; Tensor product; Wreath Product;

D O I：

10.61091/jcmcc120-26

中图分类号：

学科分类号：

摘要：

A kite K is a graph which can be obtained by joining an edge to any vertex of K3. A kite with edge set {ab, bc, ca, cd} can be denoted as (a, b, c; cd). If every vertex of a kite in the decomposition lies in different partite sets, then we say that a kite decomposition of a multipartite graph is a gregarious kite decomposition. In this manuscript, it is shown that there exists a decomposition of (Km ⊗ Kn) × (Kr ⊗ Ks) into gregarious kite if and only if n2s2m(m - 1)r(r - 1) ≡ 0 (mod 8), where ⊗, × denote the wreath product and tensor product of graphs respectively. We denote a gregarious kite decomposition as GK-decomposition. © 2024 the Author(s).

引用

页码：295 / 299

页数：4

共 13 条

[1]

Bermond J.C., Schonheim J., G-decomposition of Kn, where G has four vertices or less, Discrete Mathematics, 19, 2, pp. 113-120, (1977)

[2]

Wang H., Chang Y., Kite-group Divisible Designs of Type g t u 1, Graphs & Combinatorics, 22, 4, pp. 545-571, (2006)

[3]

Wang H., Chang Y., (K-3+ e, lambda)-group divisible designs of type g (t) u (1), Ars Combinatoria, 89, pp. 63-88, (2008)

[4]

Wang L., On the Existence of Resolvable (K+ e)-Group Divisible Designs, Graphs & Combinatorics, 26, 6, pp. 879-889, (2010)

[5]

Fu C.M., Hsu Y.F., Lo S.W., Huang W.C., Some gregarious kite decompositions of complete equipartite graphs, Discrete Mathematics, 313, 5, pp. 726-732, (2013)

[6]

Gionfriddo M., Milici S., On the existence of uniformly resolvable decompositions of Kv and Kv-I into paths and kites, Discrete Mathematics, 313, 23, pp. 2830-2834, (2013)

[7]

Colbourn C.J., Ling A. C., Quattrocchi G., Embedding path designs into kite systems, Discrete Mathematics, 297, 1-3, pp. 38-48, (2005)

[8]

Gionfriddo L., Lindner C. C., Nesting kite and 4-cycle systems, The Australasian Journal of Combinatorics, 33, pp. 247-254, (2005)

[9]

Kucukcifci S., Lindner C.C., The Metamorphosis of Lambda-fold Block Designs with Block Size Four into Lambda-fold Kite Systems, Journal of Combinatorial Mathematics and Combinatorial Computing, 40, pp. 241-252, (2002)

[10]

Faro G.L., Tripodi A., The Doyen–Wilson theorem for kite systems, Discrete mathematics, 306, 21, pp. 2695-2701, (2006)

← 1 2 →