A (total) dominating function of a graph is a feasible solution to the linear programming relaxation of the minimum (total) dominating set integer programme. Other functions (sometimes called fractional functions) on graphs ...