On the local average order of dominating sets
The (global) average order of dominating sets of a graph is the average number of vertices of its dominating sets. Analogously, the local average order of dominating sets is the average number of vertices of its dominating sets containing a fixed vertex. In this paper, we show that the local average order of dominating sets of a graph with $n$ vertices is at least $\frac{n+1}{2}$, with equality if and only if the degree of the fixed vertex is $n-1$. Furthermore, for a graph on $n$ vertices without isolated vertices, we show that $\frac{5n-1}{6}$ is an upper bound for the local average order of dominating sets. Additionally, we give a proof of an exact formula for the local average order of dominating sets when the degree of the fixed vertex is $n-2$, and determine an upper bound for the local average order of dominating sets when the fixed vertex is an $l$-stem ($l \geq 2$).