Gregarious Kite Factorization of Tensor Product of Complete Graphs

Abstract

A kite factorization of a multipartite graph is said to be gregarious if every kite in the factorization has all its vertices in different partite sets. In this paper, we show that there exists a gregarious kite factorization of Km × Kn if and only if mn ≡ 0 (mod 4) and (m − 1)(n − 1) ≡ 0 (mod 2), where × denotes the tensor product of graphs.

Keywords

• tensor product
• kite
• decomposition
• gregarious factor
• factorization
• 05c70