Simultaneous graph parameters: factor domination and factor total domination (Q2509300): Difference between revisions

Let \(F_1,F_2,\dots,F_k\) be \(k\) factors of a graph \(G\). A subset \(S\) of \(V(G)\) is a factor dominating set if in every \(F_i\) every vertex not in \(S\) is adjacent to a vertex in \(S\), and a factor total dominating set if in every \(F_i\) every vertex in \(V(G)\) is adjacent to a vertex in \(S\). The cardinality of a smallest such set is called the factor (total) domination number. The authors present some upper bounds on the factor (total) domination number. These bounds exploit results on colorings of graphs and transversals of hypergraphs.