Name
Abstract | ||
|---|---|---|
For a fixed graph H without isolated vertices, the H-decomposition number d(H)(G) of a graph G is the minimum number of vertices that must be added to G to produce a graph that can be decomposed into copies of H. In this paper, we find formulas for d(H)(G) in the cases where H is a path or a cycle and G is a path or a cycle. We also show a general lower hound which is useful in these cases and conjecture a formula for d(pn)(k(1,m)). |
Year | Venue | DocType |
|---|---|---|
2007 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
39 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grady Bullington | 1 | 0 | 0.34 |
| Linda Eroh | 2 | 110 | 17.85 |
| Kevin McDougal | 3 | 0 | 1.69 |
| Hosien Moghadam | 4 | 0 | 0.34 |
| Steven J. Winters | 5 | 12 | 6.33 |