Factor domination in graphs (Q2641315)

Let a factoring of a graph G into pairwise edge-disjoint factors \(G_ 1,...,G_ t\) be given; each of these factors contains all vertices of G. A subset \(D_ f\) of the vertex set of G is called a factor dominating set, if it is a dominating set for all the factors \(G_ 1,...,G_ t\). (A dominating set in a graph is a subset of its vertex set having the property that each vertex of the graph either is contained in it, or is adjacent to a vertex of it.) The factor domination number \(\gamma_ t(G_ 1,...,G_ t)\) is the minimum number of vertices of a factor dominating set. Some theorems on this number of general t are proved. Then the particular case \(t=2\) is studied.