A Tight Upper Bound on the Average Order of Dominating Sets of a Graph

Iain Beaton, Ben Cameron

In this paper we study the the average order of dominating sets in a graph, $\mathrm{avd}(G)$. Like other average graph parameters, the extremal graphs are of interest. Beato…