On the Volume of µ-way G-trade

Abstract

. 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 K 1 ,m -trade of volume s for underlying graph H = K 2 m, 2 m and H = K 2 m .