Year: 2025
Type: article
Abstract: Let ?Ku [1] be the ?-fold complete multipartite graph with u parts of size 1. A (K1,n, ?)-resolvable group divisible design (RGDD) of type gu is a K1,n-decomposition of the graph ?Ku [g] into parallel classes each of which is a partition of the vertex set. A (K1,n, ?)-frame of type gu is a K1,n-decomposition of ?Ku [g] into partial parallel classes each of which is a partition of the vertex set except for those vertices in one of the u parts. In this paper, we completely solve the existence of a (K1,4, ?)-frame and a (K1,4, ?)-RGDD of type gu for any admissible parameters g, u and ?.
Source: Filomat
DOI: 10.2298/fil2505717w
Author: Li Wang
Institution: Suqian University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Award: G5798666299
OpenAlex ID: W4412757541
