Embedding Partial k-Star Designs

作者:Hoffman D G*; Roberts Dan
来源:Journal of Combinatorial Designs, 2014, 22(4): 161-170.
DOI:10.1002/jcd.21353

摘要

A k-star is the complete bipartite graph K1,k. Let G and H be graphs, and let B be a partial H-decomposition of G. A partial H-decomposition, B, of another graph G is called an embedding of B provided that BB and G is a subgraph of G. We find an embedding of a partial k-star decomposition of Kn into a k-star decomposition of Kn+s, where s is at most 7k-4 if k is odd, and 8k-4 if k is even.

  • 出版日期2014-4

全文