A graph $G=(V,E)$ is $\gamma$-excellent if $V$ a union of all $\gamma$-sets $G$, where $\gamma$ stands for the domination number. Let $\mathcal{I}$ be set mutually nonisomorphic graphs and $\emptyset \not= \mathcal{H} \subsetneq \mathcal{I}$. In this paper we initiate study $\mathcal{H}$-$\gamma$-excellent graphs, which define as follows. $G$ following hold: (i) every $H \in \mathcal{H}$ each $...