On the Volume of µ-way G-trade

A µ-way G-trade (µ ≥ 2) consists of µ disjoint decompositions of some simple (underlying) graph H into copies of a graph G. The number of copies of the graph G in each of the decompositions is the volume of the G-trade and denoted by s. In this paper, we determine all values s for which there exists a µ-way K1,m-trade of volume s for underlying graph H = K2m,2m and H = K2m.