H-decomposition number

[math]\displaystyle{ H }[/math]-decomposition number --- число [math]\displaystyle{ H }[/math]-разложения.

For a fixed graph [math]\displaystyle{ H }[/math] without isolated vertices, the [math]\displaystyle{ H }[/math]-decomposition number [math]\displaystyle{ d_{H}(G) }[/math] of a graph is the minimum number of vertices that must be added to [math]\displaystyle{ G }[/math] to produce a graph that can be decomposed into copies of [math]\displaystyle{ H }[/math]. (Any number of edges may be added incident with the new vertices.)