چکیده:
A $ mu $-way $ G $-trade ($ mu geq 2) $ consists of $ mu $ 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 $ mu $-way $ K_{1,m} $-trade of volume $ s $ for underlying graph $ H=K_{2m,2m} $ and $ H=K_{2m} $.
نوع مطالعه:
پژوهشي |
موضوع مقاله:
تخصصي