摘要
Let be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer copies of H<sub>i</sub>, where . Let C<sub>k</sub>, P<sub>k</sub> and S<sub>k</sub> denote a cycle, a path and a star with k edges, respectively. For an integer , we prove that a balanced complete bipartite multigraph has a -decomposition if and only if k is even, and .
Let be a family of subgraphs of a graph G. An L-decomposition of G is an edge-disjoint decomposition of G into positive integer copies of H<sub>i</sub>, where . Let C<sub>k</sub>, P<sub>k</sub> and S<sub>k</sub> denote a cycle, a path and a star with k edges, respectively. For an integer , we prove that a balanced complete bipartite multigraph has a -decomposition if and only if k is even, and .
作者
Jenq-Jong Lin
Min-Jen Jou
Jenq-Jong Lin;Min-Jen Jou(Department of Finance, Ling Tung University, Taiwan;Department of Information Technology, Ling Tung University, Taiwan)